TY - GEN
T1 - Preemptively scheduling hard-real-time sporadic tasks on one processor
AU - Baruah, Sanjoy K.
AU - Mok, Aloysius K.
AU - Rosier, Louis E.
PY - 1990
Y1 - 1990
N2 - In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested efficiently (unless P = NP). They do, however, lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
AB - In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested efficiently (unless P = NP). They do, however, lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
UR - https://www.scopus.com/pages/publications/84880861455
U2 - 10.1109/REAL.1990.128746
DO - 10.1109/REAL.1990.128746
M3 - Conference contribution
AN - SCOPUS:84880861455
SN - 0818621125
SN - 9780818621123
T3 - Proceedings - Real-Time Systems Symposium
SP - 182
EP - 190
BT - 1990 Proceedings 11th Real-Time Systems Symposium, RTSS 1990
T2 - 1990 11th Real-Time Systems Symposium, RTSS 1990
Y2 - 5 December 1990 through 7 December 1990
ER -