Multi-round real-time divisible load scheduling for clusters

Xuan Lin, Jitender Deogun, Ying Lu, Steve Goddard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing - HiPC 2008 - 15th International Conference, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)354089893X, 9783540898931
StatePublished - 2008
Externally publishedYes
Event15th International Conference on High Performance Computing, HiPC 2008 - Bangalore, India
Duration: Dec 17 2008Dec 20 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5374 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Conference on High Performance Computing, HiPC 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Multi-round real-time divisible load scheduling for clusters'. Together they form a unique fingerprint.

Cite this