DocumentCode :
2348293
Title :
Static-priority scheduling on multiprocessors
Author :
Andersson, Björn ; Baruah, Sanjoy ; Jonsson, Jan
Author_Institution :
Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
fYear :
2001
fDate :
3-6 Dec. 2001
Firstpage :
193
Lastpage :
202
Abstract :
The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm. It is proven that this algorithm successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocessor platform. It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability for a periodic task set with a utilization higher than one half the capacity of the multiprocessor platform.
Keywords :
processor scheduling; periodic tasks; preemptive scheduling; rate-monotonic scheduling; schedulability; scheduling algorithm; static-priority scheduling; Context modeling; Optimal scheduling; Partitioning algorithms; Processor scheduling; Real time systems; Research initiatives; Runtime; Scheduling algorithm; Subspace constraints; System testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems Symposium, 2001. (RTSS 2001). Proceedings. 22nd IEEE
Print_ISBN :
0-7695-1420-0
Type :
conf
DOI :
10.1109/REAL.2001.990610
Filename :
990610
Link To Document :
بازگشت