Iterative robust multiprocessor scheduling
conference paper
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. cop. 2015 ACM.
TNO Identifier
534081
ISBN
9781450335911
Publisher
Association for Computing Machinery
Source title
23rd International Conference on Real-Time Networks and Systems, RTNS 2015, 4 November 2015 through 6 November 2015
Pages
23-32
Files
To receive the publication files, please send an e-mail request to TNO Repository.