In this paper, we describe a new algorithm for the problem of checking whether a real-time system has a Partially Clairvoyant schedule (PCS). Existing algorithms for the PCS problem are predicated on sequential quantifier elimination, i.e., the innermost quantifier is eliminated first, followed by the next one and so on. Our technique is radically different in that the quantifiers in the schedulability specification are eliminated in arbitrary fashion. We demonstrate the usefulness of this technique by achieving significant performance improvement over a wide range of inputs. Additionally, the analysis developed for the new procedure may find applications in domains such as finite model theory and classical logic.
[1]
Richard Gerber,et al.
Parametric Dispatching of Hard Real-Time Tasks
,
1995,
IEEE Trans. Computers.
[2]
K. Subramani,et al.
An Analysis of Partially Clairvoyant Scheduling
,
2003,
J. Math. Model. Algorithms.
[3]
Andrew V. Goldberg,et al.
Shortest paths algorithms: Theory and experimental evaluation
,
1994,
SODA '94.
[4]
Steve Chien,et al.
On Board Planning for Autonomous Spacecraft
,
1999
.
[5]
Volker Weispfenning,et al.
Simulation and Optimization by Quantifier Elimination
,
1997,
J. Symb. Comput..