A faster exact multiprocessor schedulability test for sporadic tasks

Baker and Cirinei introduced an exact but naive algorithm, based on solving a state reachability problem in a finite automaton, to check whether sets of sporadic hard real-time tasks are schedulable on identical multiprocessor platforms. However, the algorithm suffered from poor performance due to the exponential size of the automaton relative to the size of the task set. In this paper, we successfully apply techniques developed by the formal verification community, specifically antichain algorithms, by defining and proving the correctness of a simulation relation on Baker and Cirinei's automaton. We show our improved algorithm yields dramatically improved performance for the schedulability test and opens for many further improvements.

[1]  Thomas A. Henzinger,et al.  Antichains: A New Algorithm for Checking Universality of Finite Automata , 2006, CAV.

[2]  Sanjoy K. Baruah,et al.  Schedulability Analysis of Multiprocessor Sporadic Task Systems , 2007, Handbook of Real-Time and Embedded Systems.

[3]  Sanjoy K. Baruah,et al.  Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems , 2007, OPODIS.

[4]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[5]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[6]  Sanjoy Baruah,et al.  EDF scheduling on multiprocessor platforms: some (perhaps) counterintuitive observations , 2002 .

[7]  Eduardo Tovar,et al.  Principles of Distributed Systems, 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings , 2007, OPODIS.

[8]  A. Marchetti-Spaccamela,et al.  Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems , 2010, Algorithmica.

[9]  Wang Yi,et al.  Task automata: Schedulability, decidability and undecidability , 2007, Inf. Comput..

[10]  Franck Cassez,et al.  Timed Games for Computing WCET for Pipelined Processors with Caches , 2011, 2011 Eleventh International Conference on Application of Concurrency to System Design.

[11]  Jean-François Raskin,et al.  Antichain Algorithms for Finite Automata , 2010, TACAS.

[12]  Theodore P. Baker,et al.  Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks , 2007, OPODIS.

[13]  Giorgio Delzanno,et al.  Covering sharing trees: a compact data structure for parameterized verification , 2004, International Journal on Software Tools for Technology Transfer.

[14]  Marko Bertogna,et al.  Tests for global EDF schedulability analysis , 2011, J. Syst. Archit..

[15]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[16]  Jean-François Raskin,et al.  An Antichain Algorithm for LTL Realizability , 2009, CAV.

[17]  Oded Maler,et al.  Preemptive Job-Shop Scheduling Using Stopwatch Automata , 2002, TACAS.