Improving first-come-first-serve job scheduling by gang scheduling
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 180-198
- https://doi.org/10.1007/bfb0053987
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Gang scheduling for highly efficient, distributed multiprocessor systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved utilization and responsiveness with gang schedulingPublished by Springer Nature ,1997
- Theory and practice in parallel job schedulingPublished by Springer Nature ,1997
- Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical ControlJournal of Parallel and Distributed Computing, 1996
- Packing schemes for gang schedulingPublished by Springer Nature ,1996
- Toward convergence in job schedulers for parallel supercomputersPublished by Springer Nature ,1996
- Dynamic scheduling on parallel machinesTheoretical Computer Science, 1994
- Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policiesPublished by Association for Computing Machinery (ACM) ,1994
- Gang scheduling performance benefits for fine-grain synchronizationJournal of Parallel and Distributed Computing, 1992
- Bounds for Multiprocessor Scheduling with Resource ConstraintsSIAM Journal on Computing, 1975