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 Citations (Scopus)

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
Pages308-319
Number of pages12
StatePublished - Dec 1 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
CountryIndia
CityGoa
Period12/18/0712/21/07

Fingerprint

Divisible Loads
Quality of service
Scheduling
Real-time
Partitioning
Performance Guarantee
System Performance
Integrate
Demonstrate
Simulation

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lin, X., Lu, Y., Deogun, J., & Goddard, S. (2007). Enhanced real-time divisible load scheduling with different processor available times. In High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings (pp. 308-319). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4873 LNCS).

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

High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. 2007. p. 308-319 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4873 LNCS).

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

Lin, X, Lu, Y, Deogun, J & Goddard, S 2007, Enhanced real-time divisible load scheduling with different processor available times. in High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4873 LNCS, pp. 308-319, 14th International Conference on High-Performance Computing, HiPC 2007, Goa, India, 12/18/07.
Lin X, Lu Y, Deogun J, Goddard S. Enhanced real-time divisible load scheduling with different processor available times. In High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. 2007. p. 308-319. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Lin, Xuan ; Lu, Ying ; Deogun, Jitender ; Goddard, Steve. / Enhanced real-time divisible load scheduling with different processor available times. High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. 2007. pp. 308-319 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{803c88d03c004e32afb681866ad6b080,
title = "Enhanced real-time divisible load scheduling with different processor available times",
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.",
keywords = "Cluster computing, Divisible load, Inserted idle time, Real-time scheduling",
author = "Xuan Lin and Ying Lu and Jitender Deogun and Steve Goddard",
year = "2007",
month = "12",
day = "1",
language = "English (US)",
isbn = "9783540772194",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "308--319",
booktitle = "High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings",

}

TY - GEN

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

AU - Lin, Xuan

AU - Lu, Ying

AU - Deogun, Jitender

AU - Goddard, Steve

PY - 2007/12/1

Y1 - 2007/12/1

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

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

KW - Cluster computing

KW - Divisible load

KW - Inserted idle time

KW - Real-time scheduling

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

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

M3 - Conference contribution

AN - SCOPUS:38349080672

SN - 9783540772194

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 308

EP - 319

BT - High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings

ER -