An E cient Scheduling Algorithm for Multiprogramming on Parallel Computing Systems

In conventional coscheduling, or gang scheduling of parallel workloads a round-robin queueing algorithm is adopted and the length of scheduling slots is xed. However, the characteristics of parallel workloads can be quite di erent from sequential workloads. The system may not perform e ectively using the simple round-robin algorithm. In this paper we introduce a new queueing algorithm. Our new system consists of two queues, a service queue which can hold more than one processes and a waiting queue which has multiple levels. This system has several potential advantages over some conventional queueing systems in scheduling parallel workloads. For example, it may achieve a higher system throughput and also a higher cache hit ratio, so the problems encountered in conventional coscheduling are alleviated. The issue of implementation of our algorithm is also discussed.