Enhanced real-time divisible load scheduling with different processor available times

Xuan Lin, Ying Lu, Jitender Deogun, Steve Goddard

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

2 Scopus citations

Abstract

Providing QoS and performance guarantees for arbitrarily divisible loads in a cluster has become a significant problem. While progress is being made in scheduling arbitrarily divisible loads, some of the proposed approaches may cause Inserted Idle Times (IITs) that are detrimental to system performance. Two contributions are made in addressing this problem. First, we propose two constraints that, when satisfied, lead to an optimal partitioning in utilizing IITs. Second, we integrate the new partitioning method with a previous approach and develop an enhanced algorithm that better utilizes IITs. Simulation results demonstrate the advantages of our new approach.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing - HiPC 2007 - 14th International Conference, Proceedings
PublisherSpringer Verlag
Pages308-319
Number of pages12
ISBN (Print)9783540772194
DOIs
StatePublished - 2007
Event14th International Conference on High-Performance Computing, HiPC 2007 - Goa, India
Duration: Dec 18 2007Dec 21 2007

Publication series

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

Conference

Conference14th International Conference on High-Performance Computing, HiPC 2007
Country/TerritoryIndia
CityGoa
Period12/18/0712/21/07

Keywords

  • Cluster computing
  • Divisible load
  • Inserted idle time
  • Real-time scheduling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Enhanced real-time divisible load scheduling with different processor available times'. Together they form a unique fingerprint.

Cite this