Round robin scheduling of heterogeneous parallel servers in heavy traffic |
| |
Authors: | Rong Wu Douglas G Down |
| |
Institution: | Department of Computing and Software, McMaster University, 1280 Main Street West, Hamilton, ON, Canada L8S 4L7 |
| |
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. |
| |
Keywords: | Queueing Heterogeneous servers Heavy traffic Round robin routing Shortest remaining processing time scheduling |
本文献已被 ScienceDirect 等数据库收录! |
|