The Multiprocessor Bandwidth Inheritance Protocol

Authors:
Dario Faggioli;Giuseppe Lipari;Tommaso Cucinotta
Affiliations:
-;-;-
Venue:
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Year:
2010

Citing 0
Cited 6

Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Server-based scheduling of parallel real-time tasks

Proceedings of the tenth ACM international conference on Embedded software
Analysis and implementation of the multiprocessor bandwidth inheritance protocol

Real-Time Systems
Analysis of client/server interactions in a reservation-based system

Proceedings of the 28th Annual ACM Symposium on Applied Computing
Resource sharing among real-time components under multiprocessor clustered scheduling

Real-Time Systems
Locking policies for multiprocessor ada

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the Multiprocessor Bandwidth Inheritance (M-BWI) protocol is presented, which constitutes an extension of the Bandwidth Inheritance (BWI) protocol to symmetric multiprocessor and multicore systems. Similarly to priority inheritance, M-BWI reduces priority inversion in reservation-based scheduling systems, it allows the coexistence of hard, soft and non-real-time tasks, it does not require any information on the temporal parameters of the tasks, hence, it is particularly suitable to open systems, where tasks can dynamically arrive and leave, and their temporal parameters are unknown or only partially known. Moreover, if it is possible to estimate such parameters as the worst-case execution time and the critical sections length, then it is possible to compute an upper bound to the task blocking time. Finally, the M-BWI protocol is neutral to the underlying scheduling scheme, since it can be implemented both in global and partitioned scheduling schemes.