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 poly-nomial in the number of tasks in the system are presented and proved correct.
Citation:
Sanjoy Baruah, Nathan Fisher, "Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small," rtcsa, pp.232-237, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005