By Topic

Robust Priority Assignment for Fixed Priority Real-Time Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. I. Davis ; Univ. of York, York ; A. Burns

This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a "robust" priority ordering: the most appropriate priority ordering to use in a system subject to variable amounts of additional interference from sources such as interrupts, operating system overheads, exception handling, cycle stealing, and task execution time overruns. The paper describes a robust priority assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions. Proofs are given for a number of interesting theorems about robust priority assignment, and the circumstances under which a "deadline minus jitter" monotonic partial ordering forms part of the robust ordering. The paper shows that "deadline minus jitter" monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.

Published in:

Real-Time Systems Symposium, 2007. RTSS 2007. 28th IEEE International

Date of Conference:

3-6 Dec. 2007