White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Robust priority assignment for fixed priority real-time systems

Davis, R.I. and Burns, A. (2007) Robust priority assignment for fixed priority real-time systems. In: Proceedings of the 28th IEEE Real-Time Systems Symposium. RTSS 2007, December 03 - 06, 2007, Tucson, Arizona, USA. , pp. 3-14. ISBN 0-7695-3062-1

Full text not available from this repository.

Abstract

This paper focuses on priority assignment for real- time 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.

Item Type: Proceedings Paper
Academic Units: The University of York > Computer Science (York)
Depositing User: York RAE Import
Date Deposited: 09 Apr 2009 11:19
Last Modified: 09 Apr 2009 11:19
Published Version: http://dx.doi.org/10.1109/RTSS.2007.43
Status: Published
Identification Number: 10.1109/RTSS.2007.43
URI: http://eprints.whiterose.ac.uk/id/eprint/5495

Actions (login required)

View Item View Item