DocumentCode
858638
Title
An approximate analysis of the join the shortest queue (JSQ) policy
Author
Lin, Hwa-Chun ; Raghavendra, C.S.
Author_Institution
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Volume
7
Issue
3
fYear
1996
fDate
3/1/1996 12:00:00 AM
Firstpage
301
Lastpage
307
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 N identical queues each of which may have single or multiple servers. A birth-death Markov process is used to model the evolution of the number of jobs in the system. Our results show that this method provides very accurate estimates of the average job response times
Keywords
multiprocessing systems; performance evaluation; queueing theory; resource allocation; approximate analysis; average job response times; birth-death Markov process; join the shortest queue; performance evaluation; queues; Analytical models; Concurrent computing; Delay; Distributed computing; Load management; Markov processes; Multiprocessing systems; Performance analysis; Queueing analysis; Routing;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.491583
Filename
491583
Link To Document