Multi-round real-time divisible load scheduling for clusters

Authors:
Xuan Lin;Jitender Deogun;Ying Lu;Steve Goddard
Affiliations:
Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE;Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE;Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE;Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE
Venue:
HiPC'08 Proceedings of the 15th international conference on High performance computing
Year:
2008

Citing 14
Cited 2

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster

IEEE Transactions on Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
Ten Reasons to Use Divisible Load Theory

Computer
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
A Genetic Algorithm Based Approach for Scheduling Decomposable Data Grid Applications

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Practical Divisible Load Scheduling on Grid Platforms with APST-DV

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Multiround Algorithms for Scheduling Divisible Loads

IEEE Transactions on Parallel and Distributed Systems
A taxonomy of market-based resource management systems for utility-driven cluster computing

Software—Practice & Experience
Real-Time Divisible Load Scheduling for Cluster Computing

RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Real-Time Divisible Load Scheduling with Different Processor Available Times

ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Enhanced real-time divisible load scheduling with different processor available times

HiPC'07 Proceedings of the 14th international conference on High performance computing

New method for scheduling heterogeneous multi-installment systems

Future Generation Computer Systems
Requirement-aware strategies for scheduling real-time divisible loads on clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quality of Service (QoS) provisioning for divisible loads incluster computing has attracted more attention recently. To enhance QoSand provide performance guarantees in cluster computing environmentsfor divisible loads, in this paper, we integrate a Simplified Multi-Round (SMR) strategy into the design of real-time scheduling algorithms for divisibleload applications. Four contributions are made in this paper. First,we present algorithm SMR and extend it to compute a closed form formulafor minimum number of processors required to meet an applicationdeadline. Second, we derived a closed form solution for execution timeof the optimized SMR. Third, we formally prove that optimized SMRresults in better completion time than the single round strategy. Finally,we integrate SMR with our algorithm framework and propose two setsof efficient algorithms.