The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%
Paper i proceeding, 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%.

Författare

Björn Andersson

Chalmers, Institutionen för datorteknik

Jan Jonsson

Institutionen för datorteknik, Realtidssystem

EUROMICRO Conference on Real-Time Systems

1068-3070 (ISSN)

33-40

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

DOI

10.1109/EMRTS.2003.1212725

ISBN

0-7695-1936-9

Mer information

Skapat

2017-10-07