Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2011 | RTNS | formal language,formal verification,automata theory,operating system,finite automaton,multiprocessor scheduling |
DocType | Volume | Citations |
Journal | abs/1105.5055 | 2 |
PageRank | References | Authors |
0.38 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Lindström | 1 | 24 | 1.50 |
| Gilles Geeraerts | 2 | 126 | 15.95 |
| Joël Goossens | 3 | 666 | 49.22 |