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

25 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2007 International Conference on Parallel Processing, ICPP
DOIs
StatePublished - 2007
Event36th International Conference on Parallel Processing in Xi'an, ICPP - Xi'an, China
Duration: Sep 10 2007Sep 14 2007

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Conference

Conference36th International Conference on Parallel Processing in Xi'an, ICPP
CountryChina
CityXi'an
Period9/10/079/14/07

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering(all)

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

Cite this