A new verification procedure for partially clairvoyant scheduling

Authors:
K. Subramani;D. Desovski
Affiliations:
LDCSEE, West Virginia University, Morgantown, WV;LDCSEE, West Virginia University, Morgantown, WV
Venue:
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Year:
2005

Citing 3
Cited 1

Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Simulation and optimization by quantifier elimination

Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Parametric Dispatching of Hard Real-Time Tasks

IEEE Transactions on Computers

An empirical analysis of algorithms for partially Clairvoyant scheduling

International Journal of Parallel, Emergent and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.