TY - GEN
T1 - Real-time scheduling of sporadic task systems when the number of distinct task types is small
AU - Baruah, Sanjoy
AU - Fisher, Nathan
PY - 2005
Y1 - 2005
N2 - In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadic task systems is considered here upon both a single processor, and on multiprocessor platforms under the partitioned paradigm of multiprocessor scheduling. Algorithms that have run-time polynomial in the number of tasks in the system are presented and proved correct.
AB - In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadic task systems is considered here upon both a single processor, and on multiprocessor platforms under the partitioned paradigm of multiprocessor scheduling. Algorithms that have run-time polynomial in the number of tasks in the system are presented and proved correct.
UR - https://www.scopus.com/pages/publications/33749046684
U2 - 10.1109/RTCSA.2005.75
DO - 10.1109/RTCSA.2005.75
M3 - Conference contribution
AN - SCOPUS:33749046684
SN - 0769523463
SN - 9780769523460
T3 - Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
SP - 232
EP - 237
BT - Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
T2 - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Y2 - 17 August 2005 through 19 August 2005
ER -