Conference proceeding
Real-Time Divisible Load Scheduling with Different Processor Available Times
2007 International Conference on Parallel Processing (ICPP 2007), pp.20-20
09/2007
DOI: 10.1109/ICPP.2007.70
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, some of proposed approaches may cause inserted idle times (IITs) that are detrimental to system performance. In this paper we propose a new approach that utilizes IITs and thus enhances the system performance. The novelty of our approach is that, to simplify the analysis, a homogenous system with IITs is transformed to an equivalent heterogeneous system, and that our algorithms can schedule real-time divisible loads with different processor available times. Intensive simulations show that the new approach outperforms the previous approach in all configurations. We also compare the performance of our algorithm to the current practice of manually splitting workloads by users. Simulation results validate the advantages of our approach.
Details
- Title: Subtitle
- Real-Time Divisible Load Scheduling with Different Processor Available Times
- Creators
- Xuan Lin - University of Nebraska–LincolnYing Lu - University of Nebraska–LincolnJ Deogun - University of Nebraska–LincolnS Goddard - University of Nebraska–Lincoln
- Resource Type
- Conference proceeding
- Publication Details
- 2007 International Conference on Parallel Processing (ICPP 2007), pp.20-20
- DOI
- 10.1109/ICPP.2007.70
- ISSN
- 0190-3918
- eISSN
- 2332-5690
- Publisher
- IEEE
- Language
- English
- Date published
- 09/2007
- Academic Unit
- Computer Science
- Record Identifier
- 9984259482902771
Metrics
39 Record Views