Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Algorithmic approach to bounding the mean response time of a minimum expected delay routing system
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
An Approximate Analysis of the Join the Shortest Queue (JSQ) Policy
IEEE Transactions on Parallel and Distributed Systems
Task assignment with unknown duration
Journal of the ACM (JACM)
Job placement with unknown duration and no preemption
ACM SIGMETRICS Performance Evaluation Review
Queueing Models with Multiple Waiting Lines
Queueing Systems: Theory and Applications
IEEE Transactions on Computers
Simulation of load balancing algorithms: a comparative study
ACM SIGCSE Bulletin
Analysis of join-the-shortest-queue routing for web server farms
Performance Evaluation
Insensitivity for PS server farms with JSQ routing
ACM SIGMETRICS Performance Evaluation Review
Analysis of size interval task assignment policies
ACM SIGMETRICS Performance Evaluation Review
Task assignment on parallel QoS systems
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
Computers and Electrical Engineering
A level-crossing approach to the solution of the shortest-queue problem
Operations Research Letters
| Hi-index | 0.00 |
In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are &Kgr; identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for &Kgr; ≤ 8, has an relative error of less than one half of one percent when compared to simulation. For &Kgr; = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.