2008 Euromicro Conference on Real-Time Systems (2008)
July 2, 2008 to July 4, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECRTS.2008.8
The schedulability testing for the deferrable scheduling algorithm for fixed priority transactions (DS-FP) remainsan open problem since its introduction. In this paper, wetake the first step towards investigating necessary and sufficient conditions for the DS-FP schedulability. We propose a necessary and sufficient schedulability condition for the algorithm in discrete time systems, and prove its correctness. Based on this condition, we propose a schedulability test algorithm that is more accurate than the existing test that is only based on a sufficient condition. Our algorithm exploits the fact that there is always a repeating pattern in a DS-FP schedule in discrete time systems. We demonstrate through examples that our schedulability test algorithm outperforms the existing algorithm in terms of accuracy.
D. Chen, S. Han, M. Xiong and A. K. Mok, "A Schedulability Analysis of Deferrable Scheduling Using Patterns," 2008 Euromicro Conference on Real-Time Systems(ECRTS), vol. 00, no. , pp. 47-56, 2008.