Robust Priority Assignment for Fixed Priority Real-Time Systems

  • Authors:
  • R. I. Davis;A. Burns

  • Affiliations:
  • -;-

  • Venue:
  • RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.