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 proceedingConference contributionAcademicpeer-review

1 Citation (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 languageEnglish
Title of host publication23rd International Conference on Real-Time Networks and Systems, 4-6 November 2015, Lille, France
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Pages23-32
ISBN (Print)978-1-4503-3591-1
DOIs
Publication statusPublished - 2015
Event23rd International Conference on Real-Time Networks and Systems, RTNS 2015 - Lille, France
Duration: 4 Nov 20156 Nov 2015
Conference number: 23
http://rtns2015.lifl.fr/#page=home

Conference

Conference23rd International Conference on Real-Time Networks and Systems, RTNS 2015
Abbreviated titleRTNS 2015
Country/TerritoryFrance
CityLille
Period4/11/156/11/15
Internet address

Fingerprint

Dive into the research topics of 'Iterative robust multiprocessor scheduling'. Together they form a unique fingerprint.

Cite this