Output details

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

<07>The paper proves two fundamental results for global fixed priority multiprocessor scheduling: Theorem 1 and Corollary 1 characterise the worst-case scenario. Theorems 3 and 4 prove that optimal priority assignment can be achieved under certain conditions, refuting a common misconception existing since 2000. The latter results are broadly applicable and have since led to new results in networking, mixed criticality systems, and multiprocessor scheduling. The paper led to an invited keynote talk, “Getting ones Priorities right” at RTNS 2012, and is already one of the seminal works recommended for education by the IEEE Technical Committee on Real-Time Systems (http://tcrts.org/education/seminal-papers/).