An approximation to the response time for shortest queue routing
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of the asymmetric shortest queue problem
Queueing Systems: Theory and Applications
A numerically stable algorithm for two server queue models
Queueing Systems: Theory and Applications
A Dynamic Load-Balancing Policy with a Central Job Dispatcher (LBC)
IEEE Transactions on Software Engineering
The power-series algorithm applied to the shortest-queue model
Operations Research
A spectral method for confidence interval generation and run length control in simulations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Proceedings of the 40th Conference on Winter Simulation
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
Computers and Electrical Engineering
A scheduling model for workflows on grids and clouds
Proceedings of the 8th International Workshop on Middleware for Grids, Clouds and e-Science
A bi-criteria scheduling process with CoS support on grids and clouds
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
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.