Skip to main content
SpringerLink
Log in

Transient Model for Jackson Networks and Its Approximation

  • Conference paper
Principles of Distributed Systems (OPODIS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3144))

Included in the following conference series:

Abstract

Jackson networks have been very successful in so many areas in modeling parallel and distributed systems. However, the ability of Jackson networks to predict performance with system changes remains an open question, since they do not apply to systems where there are population size constraints. Also, the product-form solution of Jackson networks assumes steady state systems with exponential service centers and FCFS queueing discipline. In this paper, we present a transient model for Jackson networks. The model is applicable under any population size. This model can be used to study the transient behavior of Jackson networks and if the number of tasks to be executed is large enough, the model accurately approaches the product-form solution (steady state solution). Finally, an approximation to the transient model using the steady state solution is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mohamed, A., Lipsky, L., Ammar, R.: Performance Modeling of a Cluster of Workstations. In: The 4th International Conference on Communications in Computing (CIC 2003), Las Vegas, NV (2003)

    Google Scholar 

  2. Mohamed, A., Lipsky, L., Ammar, R.: Transient Model for Jackson Networks and its Application in Cluster Computing. Sub. to J. of Cluster Computing (November 2003)

    Google Scholar 

  3. Mohamed, A., Ammar, R., Lipsky, L.: Efficient Data Allocation for a Cluster of Workstations. In: 16th International Conference on Parallel and Distributed Computing Systems (PDCS 2003), Reno, NV (2003)

    Google Scholar 

  4. Buyya, R.: High Performance Cluster Computing: Architecture and Systems, vol. 1. Prentice Hall PTR, NJ (1999)

    Google Scholar 

  5. Buzen, J.P.: Queueing Network Models of Multiprogramming, Ph.D. Thesis, Div. Of Engr. and Physics, Harvard University (1971)

    Google Scholar 

  6. Buzen, J.: Computational Algorithms for Closed Queueing. Comm. ACM 16(9) (September 1973)

    Google Scholar 

  7. Chen, R.J.: A Hybrid Solution of Fork/Join Synchronization in Parallel Queues. IEEE Trans. Parallel and Distributed Systems 12(8), 829–845 (2001)

    Article  Google Scholar 

  8. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  9. Gordon, W.J., Newell, G.: Closed Queueing Systems with Exponential Servers. JORSA 15, 254–265 (1967)

    MATH  Google Scholar 

  10. Jackson, J.: Jopshop-Like Queueing Systems. J. TIMS 10, 131–142 (1963)

    Google Scholar 

  11. Lipsky, L.: QUEUEING THEORY: A Linear Algebraic Approach. McMillan and Company, New York (1992)

    MATH  Google Scholar 

  12. Lipsky, L., Church, J.D.: Applications of a Queueing Network Model for a Computer System. Computing Surveys 9, 205–221 (1977)

    Article  MATH  Google Scholar 

  13. Moore, F.: Computational Model of a Closed Queueing Network with Exponential Servers. IBM J. of Res. and Develop., 567–572 (November 1962)

    Google Scholar 

  14. Muntz, R., Baskett, F., Chandy, K.: Open, closed and Mixed Networks of Queues with Different Classes of Customers. JACM 22, 248–260 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  15. Tehranipour, A., Lipsky, L.: The Generalized M/G/C//N-Queue as a Model for Time-Sharing Systems. In: ACM-IEEE Joint Symposium on Applied Computing, Fayetteville, AR (April 1990)

    Google Scholar 

  16. Trividi, K.S.: Probability & Statistics with Reliability, Queueing and Computer Science Applications. Prentice-Hall, Inc., New Jersey (1982)

    Google Scholar 

  17. Qin, A., Sholl, H., Ammar, R.: Micro Time Cost Analysis of Parallel Computations. IEEE Trans. Computers 40(5), 613–628 (1991)

    Article  Google Scholar 

  18. Yan, Y., Zhang, X., Song, Y.: An Effective and Practical Performance Prediction Model for Parallel Computing on Nondedicated Heterogeneous Networks of Workstations. J. Parallel Distributed Computing 38(1), 63–80 (1996)

    Article  Google Scholar 

  19. Zhang, T., Kang, S., Lipsky, L.: On The Performance of Parallel Computers: Order Statistics and Amdahl’s Law. International Journal Of Computers And Their Applications 3(2) (August 1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, University of Connecticut, Storrs, CT, 06269, USA

    Ahmed M. Mohamed, Lester Lipsky & Reda Ammar

Authors
  1. Ahmed M. Mohamed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lester Lipsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Reda Ammar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Engineering, Chalmers University of Technology, SE-412 96, Göteborg, Sweden

    Marina Papatriantafilou

  2. Département Scientifique Inter-Facultés, BP 7109, Université des Antilles et de la Guyane, Campus de Schoelcher, GRIMAAG, 97275 Schoelcher CEDEX, Martinique, France

    Philippe Hunel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mohamed, A.M., Lipsky, L., Ammar, R. (2004). Transient Model for Jackson Networks and Its Approximation. In: Papatriantafilou, M., Hunel, P. (eds) Principles of Distributed Systems. OPODIS 2003. Lecture Notes in Computer Science, vol 3144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27860-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27860-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22667-3

  • Online ISBN: 978-3-540-27860-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation