Book chapter
Multi-round Real-Time Divisible Load Scheduling for Clusters
High Performance Computing - HiPC 2008, pp.196-207
Lecture Notes in Computer Science, Springer Berlin Heidelberg
12/17/2008
DOI: 10.1007/978-3-540-89894-8_20
Abstract
Quality of Service (QoS) provisioning for divisible loads in cluster computing has attracted more attention recently. To enhance QoS and provide performance guarantees in cluster computing environments for divisible loads, in this paper, we integrate a Simplified Multi-Round (SMR) strategy into the design of real-time scheduling algorithms for divisible load applications. Four contributions are made in this paper. First, we present algorithm SMR and extend it to compute a closed form formula for minimum number of processors required to meet an application deadline. Second, we derived a closed form solution for execution time of the optimized SMR. Third, we formally prove that optimized SMR results in better completion time than the single round strategy. Finally, we integrate SMR with our algorithm framework and propose two sets of efficient algorithms.
Details
- Title: Subtitle
- Multi-round Real-Time Divisible Load Scheduling for Clusters
- Creators
- Xuan Lin - University of Nebraska–LincolnJitender Deogun - University of Nebraska–LincolnYing Lu - University of Nebraska–LincolnSteve Goddard - University of Nebraska–Lincoln
- Resource Type
- Book chapter
- Publication Details
- High Performance Computing - HiPC 2008, pp.196-207
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-540-89894-8_20
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 12/17/2008
- Academic Unit
- Computer Science
- Record Identifier
- 9984259423902771
Metrics
14 Record Views