Fast Performance Prediction for Periodic Task Systems

During design exploration, many implementations of the same sys-tem specification may need to be evaluated. In this paper, we present an approach to construct sufficient and necessary condi-tions for a given system specifications. These conditions can be em-ployed in the design exploration process to rapidly determine if an implementation of the system satisfies the timing constraints. We prove that our conditions always outperform the existing respective conditions. Experimental results are also provided to compare our approach with known scheduling results. 1