An efficient algorithm for real-time divisible load scheduling

Anwar Mamat, Ying Lu, Jitender S Deogun, Steve Goddard

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

7 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, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overhead. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.

Original languageEnglish (US)
Title of host publicationProceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
Pages323-332
Number of pages10
DOIs
StatePublished - Jun 28 2010
Event16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 - Stockholm, Sweden
Duration: Apr 12 2010Apr 15 2010

Publication series

NameReal-Time Technology and Applications - Proceedings
ISSN (Print)1080-1812

Conference

Conference16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
CountrySweden
CityStockholm
Period4/12/104/15/10

Fingerprint

Scheduling
Controllers
Quality of service

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Mamat, A., Lu, Y., Deogun, J. S., & Goddard, S. (2010). An efficient algorithm for real-time divisible load scheduling. In Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 (pp. 323-332). [5465991] (Real-Time Technology and Applications - Proceedings). https://doi.org/10.1109/RTAS.2010.29

An efficient algorithm for real-time divisible load scheduling. / Mamat, Anwar; Lu, Ying; Deogun, Jitender S; Goddard, Steve.

Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010. 2010. p. 323-332 5465991 (Real-Time Technology and Applications - Proceedings).

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

Mamat, A, Lu, Y, Deogun, JS & Goddard, S 2010, An efficient algorithm for real-time divisible load scheduling. in Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010., 5465991, Real-Time Technology and Applications - Proceedings, pp. 323-332, 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010, Stockholm, Sweden, 4/12/10. https://doi.org/10.1109/RTAS.2010.29
Mamat A, Lu Y, Deogun JS, Goddard S. An efficient algorithm for real-time divisible load scheduling. In Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010. 2010. p. 323-332. 5465991. (Real-Time Technology and Applications - Proceedings). https://doi.org/10.1109/RTAS.2010.29
Mamat, Anwar ; Lu, Ying ; Deogun, Jitender S ; Goddard, Steve. / An efficient algorithm for real-time divisible load scheduling. Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010. 2010. pp. 323-332 (Real-Time Technology and Applications - Proceedings).
@inproceedings{2c13a37572414ead94eb2307af19eae5,
title = "An efficient algorithm for real-time divisible load scheduling",
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, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overhead. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.",
author = "Anwar Mamat and Ying Lu and Deogun, {Jitender S} and Steve Goddard",
year = "2010",
month = "6",
day = "28",
doi = "10.1109/RTAS.2010.29",
language = "English (US)",
isbn = "9780769540016",
series = "Real-Time Technology and Applications - Proceedings",
pages = "323--332",
booktitle = "Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010",

}

TY - GEN

T1 - An efficient algorithm for real-time divisible load scheduling

AU - Mamat, Anwar

AU - Lu, Ying

AU - Deogun, Jitender S

AU - Goddard, Steve

PY - 2010/6/28

Y1 - 2010/6/28

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, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overhead. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.

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, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overhead. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.

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

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

U2 - 10.1109/RTAS.2010.29

DO - 10.1109/RTAS.2010.29

M3 - Conference contribution

SN - 9780769540016

T3 - Real-Time Technology and Applications - Proceedings

SP - 323

EP - 332

BT - Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010

ER -