The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In <it>fixed-priority</it> 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 <it>achievable utilization</it> of <tmath>(m+1)/2</tmath> upon <tmath>m</tmath> 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 <tmath>(m+1)/2</tmath>.</p>
Real-time systems, periodic task systems, identical multiprocessors, fixed-priority scheduling, utilization bounds.

S. K. Baruah, "Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors," in IEEE Transactions on Computers, vol. 53, no. , pp. 781-784, 2004.
90 ms
(Ver 3.3 (11022016))