Static-Priority Scheduling on Multiprocessors
Paper in proceeding, 2001

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.

partitioned scheduling

preemptive scheduling

fixed-priority scheduling

multiprocessor systems

Dhall's effect

Real-time scheduling

global scheduling


Björn Andersson

Department of Computer Engineering

Sanjoy Baruah

Jan Jonsson

Department of Computer Engineering

Proceedings of the IEEE Real-Time Systems Symposium, December 3−6, 2001, London, England

0-7695-1420-0 (ISBN)

Subject Categories

Computer Engineering

Computer Science

Areas of Advance

Information and Communication Technology


Basic sciences



More information