Scheduling Tasks with mixed preemption relations for robustness to timing faults

Update item information
Publication Type Journal Article
School or College College of Engineering
Department Computing, School of
Creator Regehr, John
Title Scheduling Tasks with mixed preemption relations for robustness to timing faults
Date 2002-01-01
Description This paper introduces and shows how to schedule two novel scheduling abstractions that overcome limitations of existing work on preemption threshold scheduling. The abstractions are task clusters, groups of tasks that are mutually non-preemptible by design, and task barriers, which partition the task set into subsets that must be mapped to different threads. Barriers prevent the preemption threshold logic that runs multiple design-time tasks in the same run-time thread from violating architectural constraints, e.g. by merging an interrupt handler and a user-level thread. We show that the preemption threshold logic for mapping tasks to as few threads as possible can rule out the schedules with the highest critical scaling factors - these schedules are the least likely to miss deadlines under timing faults. We have developed a framework for robust CPU scheduling and three novel algorithms: an optimal algorithm for maximizing the critical scaling factor of a task set under restricted conditions, a more generally applicable heuristic that finds schedules with approximately maximal critical scaling factors, and a heuristic search that jointly maximizes the critical scaling factor of computed schedules and minimizes the number of threads required to run a task set. We demonstrate that our techniques for robust scheduling are applicable in a wide variety of situations where static priority scheduling is used.
Type Text
Publisher Institute of Electrical and Electronics Engineers (IEEE)
First Page 1
Last Page 12
Dissertation Institution University of Utah
Language eng
Bibliographic Citation Regehr, J. (2002). Scheduling Tasks with mixed preemption relations for robustness to timing faults. In Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS 2002), 1-12. December 3-5.
Rights Management (c) 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Format Medium application/pdf
Format Extent 146,789 bytes
Identifier uspace,17505
ARK ark:/87278/s64j0zwh
Setname ir_uspace
Date Created 2012-08-01
Date Modified 2021-05-06
ID 708005
Reference URL