Transient Model for Jackson Networks and Its Approximation
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.
KeywordsPercentage Error Steady State Solution Service Center Performance Behavior Steady State Model
Unable to display preview. Download preview PDF.
- 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
- 8.Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)Google Scholar
- 10.Jackson, J.: Jopshop-Like Queueing Systems. J. TIMS 10, 131–142 (1963)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
- 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
- 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