Abstract

In fixed-priority scheduling the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization of (m + 1)/2 upon m unit-capacity processors. It is proven that this algorithm is optimal from the perspective of achievable utilization, in the sense that no fixed-priority algorithm for scheduling periodic task systems upon identical multiprocessors may have an achievable utilization greater than (m + 1)/2. Keywords: Real-time systems; Periodic task systems; Identical multiprocessors; Fixed-priority scheduling; Utilization bounds

Citations

2570	Scheduling algorithms for multiprogramming in a hard-real-time environment - Liu, Layland - 1973
332	Real-Time Systems - Liu - 2000
246	Fundamental Design Problems of Distributed Systems for Hard Real-Time Environments - Mok - 1983
171	Control robotics: the procedural control of physical processes - Dertouzos - 1974
128	On a real-time scheduling problem - Dhall, Liu - 1978
72	Priority-driven scheduling of periodic task systems on multiprocessors - Goossens, Funk, et al. - 2003
55	Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems - LOPEZ, GARCIA, et al. - 2000
38	Validating timing constraints in multiprocessor and distributed real-time systems - HA, LIU - 1994
34	Deadline-based scheduling of periodic task systems on multiprocessors - Srinivasan, Baruah - 2002
23	An analysis of EDF schedulability on a multiprocessor - BAKER