Job Re-Packing for Enhancing the Performance of Gang Scheduling

189. B. B. Zhou, R. P. Brent, C. W. Johnson and D. Walsh, Job re-packing for enhancing the performance of gang scheduling, in Job Scheduling Strategies for Parallel Processing (Proc. Fifth Workshop on Job Scheduling Strategies for Parallel Processing, San Juan, Puerto Rico, April 1999), Lecture Notes in Computer Science, Vol. 1659 (1999), 129-143.

Paper: ps (992K).


This paper presents some ideas for efficiently allocating resources to enhance the performance of gang scheduling. We first introduce a job re-packing scheme. In this scheme we try to rearrange the order of job execution on their originally allocated processors in a scheduling round to combine small fragments of available processors from different time slots together to form a larger and more useful one in a single time slot. We then describe an efficient resource allocation scheme based on job re-packing. Using this allocation scheme we are able to decrease the cost for detecting available resources when allocating processors and time to each given job, to reduce the average number of time slots per scheduling round and also to balance the workload across the processors.


Related papers are [169, 180, 181, 192, 194, 198, 202, 209].

Go to next publication

Return to Richard Brent's index page