Real-time divisible load scheduling with different processor available times

Xuan Lin, Ying Lu, Jitender S Deogun, Steve Goddard

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

25 Citations (Scopus)

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 - Dec 1 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

Fingerprint

Scheduling
Quality of service

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering(all)

Cite this

Lin, X., Lu, Y., Deogun, J. S., & Goddard, S. (2007). Real-time divisible load scheduling with different processor available times. In 2007 International Conference on Parallel Processing, ICPP [4343827] (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2007.70

Real-time divisible load scheduling with different processor available times. / Lin, Xuan; Lu, Ying; Deogun, Jitender S; Goddard, Steve.

2007 International Conference on Parallel Processing, ICPP. 2007. 4343827 (Proceedings of the International Conference on Parallel Processing).

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

Lin, X, Lu, Y, Deogun, JS & Goddard, S 2007, Real-time divisible load scheduling with different processor available times. in 2007 International Conference on Parallel Processing, ICPP., 4343827, Proceedings of the International Conference on Parallel Processing, 36th International Conference on Parallel Processing in Xi'an, ICPP, Xi'an, China, 9/10/07. https://doi.org/10.1109/ICPP.2007.70
Lin X, Lu Y, Deogun JS, Goddard S. Real-time divisible load scheduling with different processor available times. In 2007 International Conference on Parallel Processing, ICPP. 2007. 4343827. (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2007.70
Lin, Xuan ; Lu, Ying ; Deogun, Jitender S ; Goddard, Steve. / Real-time divisible load scheduling with different processor available times. 2007 International Conference on Parallel Processing, ICPP. 2007. (Proceedings of the International Conference on Parallel Processing).
@inproceedings{e050f25eb1d44f33b9ee4e5a8fce4ea4,
title = "Real-time divisible load scheduling with different processor available times",
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.",
author = "Xuan Lin and Ying Lu and Deogun, {Jitender S} and Steve Goddard",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ICPP.2007.70",
language = "English (US)",
isbn = "076952933X",
series = "Proceedings of the International Conference on Parallel Processing",
booktitle = "2007 International Conference on Parallel Processing, ICPP",

}

TY - GEN

T1 - Real-time divisible load scheduling with different processor available times

AU - Lin, Xuan

AU - Lu, Ying

AU - Deogun, Jitender S

AU - Goddard, Steve

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=47249084337&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47249084337&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2007.70

DO - 10.1109/ICPP.2007.70

M3 - Conference contribution

SN - 076952933X

SN - 9780769529332

T3 - Proceedings of the International Conference on Parallel Processing

BT - 2007 International Conference on Parallel Processing, ICPP

ER -