Job scheduling strategies for networks of workstations

181. B. B. Zhou, R. P. Brent, D. Walsh and K. Suzaki, Job scheduling strategies for networks of workstations, in Job Scheduling Strategies for Parallel Processing (Proc. Fourth Workshop on Job Scheduling Strategies for Parallel Processing, Orlando, Florida, 1998), Lecture Notes in Computer Science, Vol. 1459, Springer-Verlag, 1998, 143-157.

Paper: pdf (244K), ps (69K).


In this paper we first introduce the concepts of utilisation ratio and effective speedup and their relations to the system performance.  We then describe a two-level scheduling system which can be used to achieve good performance for parallel jobs and good response for interactive sequential jobs and also to balance both parallel and sequential workloads.  The two-level scheduling can be implemented by introducing on each processor a registration office.  We also introduce a loose gang scheduling scheme.  This scheme is scalable and has many advantages over existing explicit and implicit coscheduling schemes for scheduling parallel jobs under a time sharing environment.


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

Go to next publication

Return to Richard Brent's index page