An analysis of the join the shortest queue (JSQ) policy

H.-C Lin,C.S Raghavendra

doi:10.1109/icdcs.1992.235020

An analysis of the join the shortest queue (JSQ) policy

H.-C Lin, C.S Raghavendra

https://doi.org/10.1109/icdcs.1992.235020

Copy DOI

Publication Date: Jun 9, 1992

Citations: 16

Affiliation: Washington State University

#Join The Shortest Queue #Average Job Response Time + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

An analytical method is developed to analyze the performance of the join the shortest queue (JSQ) policy for systems with N identical queues, N>or=2. No simulation result is used to refine the analytical model. A birth-death Markov process is used to model the evolution of the total number of jobs in the system. An iterative procedure is developed to estimate the average service rates for different states. The average job response time is then obtained. Extensive simulations are performed to study the accuracy of the analysis. Results show that this method provides estimates within 3.5% of the average job response times for N up to 64. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.