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
On Job Assignment for a Parallel System of Processor Sharing Queues
IEEE Transactions on Computers
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Task assignment with unknown duration
Journal of the ACM (JACM)
IEEE Transactions on Computers
Heavy-Traffic Limits for the G/H2*/n/m Queue
Mathematics of Operations Research
On load balancing: a mix-aware algorithm for heterogeneous systems
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
| Hi-index | 0.00 |
Join-the-Shortest-Queue (JSQ) is a very old and popular routing policy for server farms. Figure 1 shows two examples of server farm architectures employing JSQ routing. In both cases, each incoming job is immediately dispatched, via a front-end router, to the queue with the fewest number of jobs, designated as the shortest queue (ties are broken at random). In Figure 1(a), jobs at a queue are served in First-Come-First-Served (FCFS) order. In Figure 1(b), jobs within a queue are served according to Processor-Sharing (PS), meaning that when there are n jobs at a queue, they share the processing capacity, each simultaneously receiving 1/nth of the service. We refer to Figure 1(a) as a JSQ/FCFS server farm and to Figure 1(b) as a JSQ/PS farm. If more detail is needed, we use the notation: M/G/K/JSQ/PS, denoting a Poisson arrival process, i.i.d. job sizes from a general distribution, K servers, JSQ routing; and PS scheduling at queues.