The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%
Paper in proceedings, 2003

This paper studies preemptive static-priority scheduling on multiprocessors. We consider two approaches: global pfair static-priority scheduling and partitioned traditional static-priority scheduling. We prove that if presented algorithms are used and if less than 50% of the capacity is used then all deadlines are met. It is known that no static-priority multiprocessor scheduling algorithm can achieve a utilization bound greater than 50%.

Author

Björn Andersson

Chalmers, Department of Computer Engineering

Jan Jonsson

Department of Computer Engineering, Real-time Systems

EUROMICRO Conference on Real-Time Systems

1068-3070 (ISSN)

33-40

Subject Categories

Computer Engineering

Computer Science

Areas of Advance

Information and Communication Technology

DOI

10.1109/EMRTS.2003.1212725

ISBN

0-7695-1936-9

More information

Created

10/7/2017