Fixed or dynamic priority? That is the question

Daniel Mossé, Ted Baker, Sanjoy Baruah, Giorgio Buttazzo, Alan Burns, Lui Sha, Jack Stankovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedulability analysis of periodic task sets. Nevertheless, many important results are not widely known and several misconceptions still exist about the properties of these two scheduling methods. Surprisingly, an exhaustive comparison between fixed priority and dynamic priority scheduling is still missing and there is not a general agreement in the real-time community about the suitability of these two scheduling approaches for future real-time systems. The purpose of the panel is to present the most controversial issues to a wide specialized audience, starting a constructive and interactive discussion aimed at clarifying some critical points and drawing some missing research lines.

Original languageEnglish (US)
Title of host publicationProceedings - 25th IEEE International Real-Time Systems Symposium, RTSS 2004
Number of pages1
StatePublished - Dec 1 2004
Event25th IEEE International Real-Time Systems Symposium, RTSS 2004 - Lisbon, Portugal
Duration: Dec 5 2004Dec 8 2004

Publication series

NameProceedings - Real-Time Systems Symposium
ISSN (Print)1052-8725


Other25th IEEE International Real-Time Systems Symposium, RTSS 2004

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Fixed or dynamic priority? That is the question'. Together they form a unique fingerprint.

Cite this