Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Optimal probabilistic allocation of customer types to servers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed 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
Approximate solution for multi-server queueing systems with Erlangian service times
Computers and Operations Research
A packet-size aware adaptive routing algorithm for parallel transmission server systems
Journal of Parallel and Distributed Computing
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
IEEE Transactions on Computers
Optimal Load Balancing in a Multiple Processor System with Many Job Classes
IEEE Transactions on Software Engineering
Analysis of size interval task assignment policies
ACM SIGMETRICS Performance Evaluation Review
Load balancing in processor sharing systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Surprising results on task assignment in server farms with high-variability workloads
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Performance Evaluation
Why segregating short jobs from long jobs under high variability is not always a win
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal allocation of servers and processing time in a load balancing system
Computers and Operations Research
Simulation model driven performance evaluation for enterprise applications
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Price of anarchy in non-cooperative load balancing
INFOCOM'10 Proceedings of the 29th conference on Information communications
To balance or unbalance load in size-interval task allocation
Probability in the Engineering and Informational Sciences
M/M/1-PS queue and size-aware task assignment
Performance Evaluation
Dispatching problem with fixed size jobs and processor sharing discipline
Proceedings of the 23rd International Teletraffic Congress
Price of anarchy in non-cooperative load balancing games
Performance Evaluation
Minimizing slowdown in heterogeneous size-aware dispatching systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Lookahead actions in dispatching to parallel queues
Performance Evaluation
| Hi-index | 0.00 |
We consider a cluster of heterogeneous servers, modeled as M/G/1 first-come first-serve queues with different processing speeds. A dispatcher that assigns jobs to the servers takes as input only the size of the arriving job and the overall job-size distribution. This general model captures the behavior of a variety of real systems, such as web server clusters. Our goal is to identify assignment strategies that the dispatcher can perform to minimize expected completion time and waiting time. We show that there exist optimal strategies that are deterministic, fixing the server to which jobs of particular sizes are always sent. We prove that the optimal strategy for systems with identical servers assigns a non-overlapping interval range of job sizes to each server. We then prove that when server processing speeds differ, it is necessary to assign each server a distinct set of intervals of job sizes in order to minimize expected waiting or response times.