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 scheme 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.
CITATION STYLE
Zhou, B. B., Brent, R. P., Walsh, D., & Suzaki, K. (1998). Job scheduling strategies for networks of workstations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1459, pp. 143–157). Springer Verlag. https://doi.org/10.1007/bfb0053985
Mendeley helps you to discover research relevant for your work.