Resource allocation schemes for gang scheduling
198.
B. B. Zhou,
D. Walsh and R. P. Brent,
Resource allocation schemes for gang scheduling,
in Job Scheduling Strategies for Parallel Processing
(Proc. Sixth JSSPP Workshop, Cancun, Mexico, May 2000),
Lecture Notes in Computer Science, Vol. 1911, 2000, 74-86.
Paper:
pdf (128K),
ps (536K).
Abstract
Gang scheduling is currently the most popular scheduling scheme for parallel
processing in a time shared environment. In this paper we first describe
the ideas of job re-packing and workload tree for efficiently allocating
resources to enhance the performance of gang scheduling. We then
present some experimental results obtained by implementing four different
resource allocation schemes. These results show how the ideas, such
as re-packing jobs, running jobs in multiple slots and minimising the average
number of time slots in the system, affect system and job performance when
incorporated into the buddy based allocation scheme for gang scheduling.
Comments
Related papers are
[169,
180,
181,
189,
192,
194,
202].
Go to next publication
Return to Richard Brent's index page