
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
HwaChun Lin, C.s. Raghavendra, "An Approximate Analysis of the Join the Shortest Queue (JSQ) Policy," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 301307, March, 1996.  
BibTex  x  
@article{ 10.1109/71.491583, author = {HwaChun Lin and C.s. Raghavendra}, title = {An Approximate Analysis of the Join the Shortest Queue (JSQ) Policy}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {3}, issn = {10459219}, year = {1996}, pages = {301307}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.491583}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Approximate Analysis of the Join the Shortest Queue (JSQ) Policy IS  3 SN  10459219 SP301 EP307 EPD  301307 A1  HwaChun Lin, A1  C.s. Raghavendra, PY  1996 KW  Analytical approximation KW  join the shortest queue KW  load balancing KW  multiprocessor systems KW  parallel queues KW  performance evaluation. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper presents an accurate analytical model for evaluating the performance of the Join the Shortest Queue (JSQ) policy. The system considered consists of
[1] I.J.B.F. Adan, J. Wessels, and W.H.M. Zijm, "Analysis of the Asymmetric Shortest Queue Problem," Queueing Systems, vol. 8, pp. 158, 1991.
[2] J.P.C. Blanc, "The PowerSeries Algorithm Applied to the ShortestQueue Model," Operations Research, vol. 40, no. 1, pp. 157167, Jan.Feb. 1992.
[3] J.W. Cohen and O.J. Boxma, Boundary Value Problems in Queueing System Analysis. NorthHolland, 1983.
[4] B.W. Conolly, "The Autostrada Queueing Problem," J. Appl. Prob., vol. 21, pp. 394403, 1984.
[5] A. Ephremides, P. Varaiya, and J. Walrand, "A Simple Dynamic Routing Problem," IEEE Trans. Automatic Control, vol. 25, pp. 690693, Aug. 1980.
[6] L. Flatto and H.P. McKean, "Two Queues in Parallel," Comm. Pure and Applied Mathematics, vol. 30, pp. 255263, 1977.
[7] W.K. Grassmann, "Transient and Steady State Results for Two Parallel Queues," Omega, vol. 8, pp. 105112, 1980.
[8] F.A. Haight, "Two Queues in Parallel," Biometrika, vol. 45, pp. 401410, 1958.
[9] S. Halfin, "The Shortest Queue Problem," J. Appl. Prob., vol. 22, pp. 865878, 1985.
[10] G.J. Foschini and J. Salz, "A Basic Dynamic Routing Problem and Diffusion," IEEE Trans. Comm., vol. 26, pp. 320327, May 1978.
[11] I. Gertsbakh, "The Shorter Queue Problem: A Numerical Study Using the MatrixGeometric Solution," European J. Operational Research, vol. 15, pp. 374381, 1984.
[12] P. Heidelberger and P. Welch, "A Spectral Method for Confidence Interval Generation and Run Length Control in Simulations," Comm. ACM, vol. 24, no. 4, pp. 233245, Apr. 1981.
[13] J.F.C. Kingman, "Two Similar Queues in Parallel," Ann. Math. Stat., vol. 32, pp. 1,3141,323, 1961.
[14] C. Knessl, B.J. Matkowsky, Z. Schuss, and C. Tier, "Two Parallel M/G/1 Queues Where Arrivals Join the Systems with the Smaller Buffer Content," IEEE Trans. Comm., vol. 35, pp. 1,1531,158, Nov. 1987.
[15] H.C. Lin and C.S. Raghavendra, “A Dynamic LoadBalancing Policy with a Central Job Dispatcher (LBC),” IEEE Trans. Software Eng., vol. 18, no. 2, pp. 148158, Feb. 1992.
[16] H.C. Lin and C.S. Raghavendra, "An Analysis of the Join the Shortest Queue (JSQ) Policy," Proc. 12th Int'l Conf. Distributed Computing Systems, pp. 362366, June, 1992.
[17] H.C. Lin and C.S. Raghavendra, "A StateAggregation Method for Analyzing Dynamic LoadBalancing Policies," Proc. 13th Int'l Conf. Distributed Computing Systems,Pittsburgh, Penn., May2528, 1993.
[18] R.D. Nelson and T.K. Philips, "An Approximation to the Response Time for Shortest Queue Routing," ACM Performance Evaluation Review, vol. 17, pp. 181189, May 1989.
[19] R.D. Nelson and T.K. Philips, "An Approximation for the Mean Response Time for Shortest Queue Routing with General Interarrival and Service Times," Performance Evaluation, vol. 17, pp. 123139, 1993.
[20] M.F. Neuts, MatrixGeometric Solutions in Stochastic Models.Baltimore: Johns Hopkins Univ. Press, 1981.
[21] B.M. Rao and M.J.M. Posner, "Algorithmic and Approximation Analyses of the Shorter Queue Model," Naval Research Logistics, vol. 34, pp. 381398, 1987.
[22] W. Winston, "Optimality of the Shortest Line Discipline," J. Appl. Prob., vol. 14, pp. 181189, 1977.
[23] Y. Zhao and W.K. Grassmann, "A Numerically Stable Algorithm for Two Server Queue Models," Queueing Systems, vol. 8, pp. 5979, 1991.