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.
The Multiprocessor Bandwidth Inheritance Protocol
Faggioli, Dario;LIPARI, Giuseppe;CUCINOTTA, TOMMASO
2010-01-01
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.File | Dimensione | Formato | |
---|---|---|---|
paper.pdf
accesso aperto
Tipologia:
Documento in Pre-print/Submitted manuscript
Licenza:
Dominio pubblico
Dimensione
255.37 kB
Formato
Adobe PDF
|
255.37 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.