Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small

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.

• Type: Conference
• Year: 2005
• Where: RTCSA
• Authors: Sanjoy K. Baruah, Nathan Fisher
• Keywords: Multiprocessor Scheduling, Real-time Application Systems, Real-Time Computing, RTCSA 2005, Sporadic Task Systems