Comparison of policies for routing customers to parallel queueing systems
Operations Research
A symptotic analysis of large heterogeneous queueing systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On Maximizing the Number of Departures Before a Deadline on Multiple
On Maximizing the Number of Departures Before a Deadline on Multiple
A comparative study of load sharing in heterogeneous multicomputer systems
ANSS '92 Proceedings of the 25th annual symposium on Simulation
A Packet-size Aware Adaptive Routing Algorithm for Parallel Transmission Server Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A packet-size aware adaptive routing algorithm for parallel transmission server systems
Journal of Parallel and Distributed Computing
Parallel and distributed systems: load sharing in heterogeneous distributed systems
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
The essence of the basic control decisions implicit in load-sharing and routing algorithms is captured in a simple model of heterogeneous queue control. The authors solve for the optimal control policy and investigate the performance of previously proposed policies in a tractable limit of this model. Using their understanding of this solvable limit, the authors propose heuristic policies for the general model. Simulation data for these policies suggest that they perform well over a wide range of system parameters.