Job Scheduling in the Presence of Multiple Resource Requirements.
Title
Job Scheduling in the Presence of Multiple Resource Requirements.
Alternative title
Published Date
1999-05-25
Publisher
Type
Report
Abstract
Recent parallel processing systems, such as the SUN E10000, are made up of pools of independently allocatable hardware and software resources such a shared memory, large disk farms, distinct I/O channels, and software licenses. In order to make efficient use of all the available system resources, the scheduling algorithm must be able to maintain a job working set which fully utilizes all of the resources. Previous work in scheduling multiple resources focused on coordinating the allocation of CPUs and memory, using ad-hoc methods for generating good schedules. We provide new job selection heuristics based on "resource balancing" which support the construction of generalized K-resource scheduling algorithms. We show through simulation that performance gains of up to 50% in average response time are achievable over classical scheduling methods such as First-Come-First-Served with First-Fit Backfilling.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 99-025
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Leinberger, William; Kumar, Vipin; Karypis, George. (1999). Job Scheduling in the Presence of Multiple Resource Requirements.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215381.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.