Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481566 | European Journal of Operational Research | 2009 | 9 Pages |
Abstract
We consider scheduling for heterogeneous server systems, where tasks arrive according to a Poisson process, with their processing requirements following a discrete distribution with finite support. For a system with a dispatcher and several heterogeneous servers, we propose an optimized multi-layered round robin routing policy followed by shortest remaining processing time scheduling at each server. Using a heavy traffic approximation, we show that the proposed policy performs as well as the optimal scheduling policy for a heterogeneous servers system with a single queue (no routing) in heavy traffic. Additional simulation results suggest that such policies will be effective in more general settings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Rong Wu, Douglas G. Down,