메뉴 건너뛰기




Volumn 7, Issue 3, 1996, Pages 301-307

An approximate analysis of the Join the Shortest Queue (JSQ) policy

Author keywords

Analytical approximation; Join the shortest queue; Load balancing; Multiprocessor systems; Parallel queues; Performance evaluation

Indexed keywords

APPROXIMATION THEORY; CHANNEL CAPACITY; MARKOV PROCESSES; MATHEMATICAL MODELS; PERFORMANCE; PROBABILITY; QUEUEING THEORY;

EID: 0030110030     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.491583     Document Type: Article
Times cited : (29)

References (23)
  • 1
    • 0001911710 scopus 로고
    • Analysis of the Asymmetric Shortest Queue Problem
    • I.J.B.F. Adan, J. Wessels, and W.H.M. Zijm "Analysis of the Asymmetric Shortest Queue Problem," Queueing Systems, vol. 8, pp. 1-58, 1991.
    • (1991) Queueing Systems , vol.8 , pp. 1-58
    • Adan, I.J.B.F.1    Wessels, J.2    Zijm, W.H.M.3
  • 2
    • 0000535903 scopus 로고
    • The Power-Series Algorithm Applied to the Shortest-Queue Model
    • Jan.-Feb.
    • J.P.C. Blanc, "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, vol. 40, no. 1, pp. 157-167, Jan.-Feb. 1992.
    • (1992) Operations Research , vol.40 , Issue.1 , pp. 157-167
    • Blanc, J.P.C.1
  • 4
    • 0021450017 scopus 로고
    • The Autostrada Queueing Problem
    • B.W. Conolly, "The Autostrada Queueing Problem," J. Appl. Prob., vol. 21, pp. 394-403, 1984.
    • (1984) J. Appl. Prob. , vol.21 , pp. 394-403
    • Conolly, B.W.1
  • 7
    • 0043049072 scopus 로고
    • Transient and Steady State Results for Two Parallel Queues
    • W.K. Grassmann, "Transient and Steady State Results for Two Parallel Queues," Omega, vol. 8, pp. 105-112, 1980.
    • (1980) Omega , vol.8 , pp. 105-112
    • Grassmann, W.K.1
  • 8
    • 0004925950 scopus 로고
    • Two Queues in Parallel
    • F.A. Haight, "Two Queues in Parallel," Biometrika, vol. 45, pp. 401-410, 1958.
    • (1958) Biometrika , vol.45 , pp. 401-410
    • Haight, F.A.1
  • 9
    • 0022320555 scopus 로고
    • The Shortest Queue Problem
    • S. Halfin, "The Shortest Queue Problem," J. Appl. Prob., vol. 22, pp. 865-878, 1985.
    • (1985) J. Appl. Prob. , vol.22 , pp. 865-878
    • Halfin, S.1
  • 10
    • 0017945908 scopus 로고
    • A Basic Dynamic Routing Problem and Diffusion
    • May
    • G.J. Foschini and J. Salz, "A Basic Dynamic Routing Problem and Diffusion," IEEE Trans. Comm., vol. 26, pp. 320-327, May 1978.
    • (1978) IEEE Trans. Comm. , vol.26 , pp. 320-327
    • Foschini, G.J.1    Salz, J.2
  • 11
    • 0021387896 scopus 로고
    • The Shorter Queue Problem: A Numerical Study Using the Matrix-Geometric Solution
    • I. Gertsbakh, "The Shorter Queue Problem: A Numerical Study Using the Matrix-Geometric Solution," European J. Operational Research, vol. 15, pp. 374-381, 1984.
    • (1984) European J. Operational Research , vol.15 , pp. 374-381
    • Gertsbakh, I.1
  • 12
    • 0018999251 scopus 로고
    • A Spectral Method for Confidence Interval Generation and Run Length Control in Simulations
    • Apr.
    • 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. 233-245, Apr. 1981.
    • (1981) Comm. ACM , vol.24 , Issue.4 , pp. 233-245
    • Heidelberger, P.1    Welch, P.2
  • 13
    • 0001425720 scopus 로고
    • Two Similar Queues in Parallel
    • J.F.C. Kingman, "Two Similar Queues in Parallel," Ann. Math. Stat., vol. 32, pp. 1,314-1,323, 1961.
    • (1961) Ann. Math. Stat. , vol.32
    • Kingman, J.F.C.1
  • 14
    • 0023451173 scopus 로고
    • Two Parallel M/G/1 Queues Where Arrivals Join the Systems with the Smaller Buffer Content
    • Nov.
    • 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,153-1,158, Nov. 1987.
    • (1987) IEEE Trans. Comm. , vol.35
    • Knessl, C.1    Matkowsky, B.J.2    Schuss, Z.3    Tier, C.4
  • 15
    • 0026819569 scopus 로고
    • A Dynamic Load Balancing Policy with a Central Job Dispatcher (LBC)
    • Feb.
    • H.C. Lin and C.S. Raghavendra, "A Dynamic Load Balancing Policy with a Central Job Dispatcher (LBC)," IEEE Trans. Software Eng., vol. 18, no. 2, pp. 148-158, Feb. 1992.
    • (1992) IEEE Trans. Software Eng. , vol.18 , Issue.2 , pp. 148-158
    • Lin, H.C.1    Raghavendra, C.S.2
  • 17
    • 0027204315 scopus 로고
    • A State-Aggregation Method for Analyzing Dynamic Load-Balancing Policies
    • Pittsburgh, Penn., May 25-28
    • H.C. Lin and C.S. Raghavendra, "A State-Aggregation Method for Analyzing Dynamic Load-Balancing Policies," Proc. 13th Int'l Conf. Distributed Computing Systems, Pittsburgh, Penn., May 25-28, 1993.
    • (1993) Proc. 13th Int'l Conf. Distributed Computing Systems
    • Lin, H.C.1    Raghavendra, C.S.2
  • 18
    • 0024662867 scopus 로고
    • An Approximation to the Response Time for Shortest Queue Routing
    • May
    • R.D. Nelson and T.K. Philips, "An Approximation to the Response Time for Shortest Queue Routing," ACM Performance Evaluation Review, vol. 17, pp. 181-189, May 1989.
    • (1989) ACM Performance Evaluation Review , vol.17 , pp. 181-189
    • Nelson, R.D.1    Philips, T.K.2
  • 19
    • 38249007481 scopus 로고
    • An Approximation for the Mean Response Time for Shortest Queue Routing with General Interarrival and Service Times
    • 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. 123-139, 1993.
    • (1993) Performance Evaluation , vol.17 , pp. 123-139
    • Nelson, R.D.1    Philips, T.K.2
  • 21
    • 0023364549 scopus 로고
    • Algorithmic and Approximation Analyses of the Shorter Queue Model
    • B.M. Rao and M.J.M. Posner, "Algorithmic and Approximation Analyses of the Shorter Queue Model," Naval Research Logistics, vol. 34, pp. 381-398, 1987.
    • (1987) Naval Research Logistics , vol.34 , pp. 381-398
    • Rao, B.M.1    Posner, M.J.M.2
  • 22
    • 0000412889 scopus 로고
    • Optimality of the Shortest Line Discipline
    • W. Winston, "Optimality of the Shortest Line Discipline," J. Appl. Prob., vol. 14, pp. 181-189, 1977.
    • (1977) J. Appl. Prob. , vol.14 , pp. 181-189
    • Winston, W.1
  • 23
    • 0002220147 scopus 로고
    • A Numerically Stable Algorithm for Two Server Queue Models
    • Y. Zhao and W.K. Grassmann, "A Numerically Stable Algorithm for Two Server Queue Models," Queueing Systems, vol. 8, pp. 59-79, 1991.
    • (1991) Queueing Systems , vol.8 , pp. 59-79
    • Zhao, Y.1    Grassmann, W.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.