Issue No. 08 - August (2003 vol. 29)
Tei-Wei Kuo , IEEE
Kwei-Jay Lin , IEEE
<p><b>Abstract</b>—Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability tests proposed to date have a high complexity and may not be suitable for online tests. In this paper, we present new efficient online schedulability tests for both the periodic process model and the multiframe process model in uniprocessor environments. The schedulability tests are shown to be more precise and efficient than any existing polynomial-time schedulability tests. Moreover, the tests can be done incrementally as each new task arrives at the system. Our proposed tests can also be used for the multiframe model where a task may have different computation times in different periods. We show the performance of the proposed schedulability tests in several simulation experiments.</p>
Real-time systems, schedulability test, division graph, reduced set, multiframe process, open system environment, MPEG streams, time reservation.
Tei-Wei Kuo, Li-Pin Chang, Kwei-Jay Lin, Yu-Hua Liu, "Efficient Online Schedulability Tests for Real-Time Systems", IEEE Transactions on Software Engineering, vol. 29, no. , pp. 734-751, August 2003, doi:10.1109/TSE.2003.1223647