Conference proceeding
An Efficient Algorithm for Real-Time Divisible Load Scheduling
2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pp.323-332
04/2010
DOI: 10.1109/RTAS.2010.29
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 overhead. 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.
Details
- Title: Subtitle
- An Efficient Algorithm for 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
- Conference proceeding
- Publication Details
- 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pp.323-332
- Publisher
- IEEE
- DOI
- 10.1109/RTAS.2010.29
- ISSN
- 1545-3421
- eISSN
- 2642-7346
- Language
- English
- Date published
- 04/2010
- Academic Unit
- Computer Science
- Record Identifier
- 9984259433102771
Metrics
12 Record Views