Conference
On the Relative Value of Local Scheduling versus Routing in Parallel Server Systems
Abstract
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling policy at a server. To this end, we study random routing followed by a priority scheme at each server. Our numerical results show that the performance (mean waiting time) of such a policy could be significantly better than the best known suggested policies that use FCFS …
Authors
Wu R; Down DG
Volume
2
Pagination
pp. 1-9
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
December 1, 2007
DOI
10.1109/icpads.2007.4447751
Name of conference
2007 International Conference on Parallel and Distributed Systems