Iterative robust multiprocessor scheduling

S. Adyanthaya; M.C.W. Geilen; A.A. Basten; J.P.M. Voeten; R.R.H. Schiffelers

doi:10.1145/2834848.2834857

Iterative robust multiprocessor scheduling

S. Adyanthaya, M.C.W. Geilen, A.A. Basten, J.P.M. Voeten, R.R.H. Schiffelers

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

Abstract

General purpose platforms are characterized by unpredictable timing behavior. Real-time schedules of tasks on general purpose platforms need to be robust against variations in task execution times. We define robustness in terms of the expected number of tasks that miss deadlines. We present an iterative robust scheduler that produces robust multiprocessor schedules of directed acyclic graphs with a low expected number of tasks that miss their deadlines. We experimentally show that this robust scheduler produces significantly more robust schedules in comparison to a scheduler using nominal execution times on both real world and synthetic test cases.

Original language	English
Title of host publication	23rd International Conference on Real-Time Networks and Systems, 4-6 November 2015, Lille, France
Place of Publication	New York
Publisher	Association for Computing Machinery, Inc
Pages	23-32
ISBN (Print)	978-1-4503-3591-1
DOIs	https://doi.org/10.1145/2834848.2834857
Publication status	Published - 2015
Event	23rd International Conference on Real-Time Networks and Systems, RTNS 2015 - Lille, France Duration: 4 Nov 2015 → 6 Nov 2015 Conference number: 23

Conference

Conference	23rd International Conference on Real-Time Networks and Systems, RTNS 2015
Abbreviated title	RTNS 2015
Country/Territory	France
City	Lille
Period	4/11/15 → 6/11/15

Access to Document

10.1145/2834848.2834857

Cite this

@inproceedings{47846bdc257c45b19eb5c85ff05383b6,

title = "Iterative robust multiprocessor scheduling",

abstract = "General purpose platforms are characterized by unpredictable timing behavior. Real-time schedules of tasks on general purpose platforms need to be robust against variations in task execution times. We define robustness in terms of the expected number of tasks that miss deadlines. We present an iterative robust scheduler that produces robust multiprocessor schedules of directed acyclic graphs with a low expected number of tasks that miss their deadlines. We experimentally show that this robust scheduler produces significantly more robust schedules in comparison to a scheduler using nominal execution times on both real world and synthetic test cases.",

author = "S. Adyanthaya and M.C.W. Geilen and A.A. Basten and J.P.M. Voeten and R.R.H. Schiffelers",

year = "2015",

doi = "10.1145/2834848.2834857",

language = "English",

isbn = "978-1-4503-3591-1",

pages = "23--32",

booktitle = "23rd International Conference on Real-Time Networks and Systems, 4-6 November 2015, Lille, France",

publisher = "Association for Computing Machinery, Inc",

address = "United States",

note = "23rd International Conference on Real-Time Networks and Systems, RTNS 2015, RTNS 2015 ; Conference date: 04-11-2015 Through 06-11-2015",

}

Adyanthaya, S, Geilen, MCW , Basten, AA , Voeten, JPM & Schiffelers, RRH 2015, Iterative robust multiprocessor scheduling. in 23rd International Conference on Real-Time Networks and Systems, 4-6 November 2015, Lille, France. Association for Computing Machinery, Inc, New York, pp. 23-32, 23rd International Conference on Real-Time Networks and Systems, RTNS 2015, Lille, France, 4/11/15. https://doi.org/10.1145/2834848.2834857

Iterative robust multiprocessor scheduling. / Adyanthaya, S.; Geilen, M.C.W.; Basten, A.A. et al.
23rd International Conference on Real-Time Networks and Systems, 4-6 November 2015, Lille, France. New York: Association for Computing Machinery, Inc, 2015. p. 23-32.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Iterative robust multiprocessor scheduling

AU - Adyanthaya, S.

AU - Geilen, M.C.W.

AU - Basten, A.A.

AU - Voeten, J.P.M.

AU - Schiffelers, R.R.H.

N1 - Conference code: 23

PY - 2015

Y1 - 2015

N2 - General purpose platforms are characterized by unpredictable timing behavior. Real-time schedules of tasks on general purpose platforms need to be robust against variations in task execution times. We define robustness in terms of the expected number of tasks that miss deadlines. We present an iterative robust scheduler that produces robust multiprocessor schedules of directed acyclic graphs with a low expected number of tasks that miss their deadlines. We experimentally show that this robust scheduler produces significantly more robust schedules in comparison to a scheduler using nominal execution times on both real world and synthetic test cases.

AB - General purpose platforms are characterized by unpredictable timing behavior. Real-time schedules of tasks on general purpose platforms need to be robust against variations in task execution times. We define robustness in terms of the expected number of tasks that miss deadlines. We present an iterative robust scheduler that produces robust multiprocessor schedules of directed acyclic graphs with a low expected number of tasks that miss their deadlines. We experimentally show that this robust scheduler produces significantly more robust schedules in comparison to a scheduler using nominal execution times on both real world and synthetic test cases.

U2 - 10.1145/2834848.2834857

DO - 10.1145/2834848.2834857

M3 - Conference contribution

SN - 978-1-4503-3591-1

SP - 23

EP - 32

BT - 23rd International Conference on Real-Time Networks and Systems, 4-6 November 2015, Lille, France

PB - Association for Computing Machinery, Inc

CY - New York

T2 - 23rd International Conference on Real-Time Networks and Systems, RTNS 2015

Y2 - 4 November 2015 through 6 November 2015

ER -

Iterative robust multiprocessor scheduling

Abstract

Conference

Access to Document

Fingerprint

Cite this