Journal article
Efficient real-time divisible load scheduling
Journal of parallel and distributed computing, Vol.72(12), pp.1603-1616
12/01/2012
DOI: 10.1016/j.jpdc.2012.09.003
Abstract
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees. (c) 2012 Elsevier Inc. All rights reserved.
Details
- Title: Subtitle
- Efficient real-time divisible load scheduling
- Creators
- Anwar Mamat - University of Nebraska–LincolnYing Lu - University of Nebraska–LincolnJitender Deogun - University of Nebraska–LincolnSteve Goddard - University of Nebraska–Lincoln
- Resource Type
- Journal article
- Publication Details
- Journal of parallel and distributed computing, Vol.72(12), pp.1603-1616
- Publisher
- Elsevier
- DOI
- 10.1016/j.jpdc.2012.09.003
- ISSN
- 0743-7315
- eISSN
- 1096-0848
- Number of pages
- 14
- Language
- English
- Date published
- 12/01/2012
- Academic Unit
- Computer Science
- Record Identifier
- 9984259471602771
Metrics
13 Record Views