Sharing resources in hierarchical real-time systems implemented with reservation servers requires the adoption of special budget management protocols that preserve the bandwidth allocated to a specific component. In addition, blocking times must be accurately estimated to guarantee both the global feasibility of all the servers and the local schedulability of applications running on each component. This paper presents two new local schedulability tests to verify the schedulability of real-time applications running on reservation servers under fixed priority and EDF local schedulers. Reservation servers are implemented with the BROE algorithm. A simple extension to the SRP protocol is also proposed to reduce the blocking time of the server when accessing global resources shared among components. The performance of the new schedulability tests are compared with other solutions proposed in the literature, showing the effectiveness of the proposed improvements. Finally, an implementation of the main protocols on a lightweight RTOS is described, highlighting the main practical issues that have been encountered.

Schedulability Analysis of Hierarchical Real-Time Systems under Shared Resources / Biondi, Alessandro; Buttazzo, Giorgio C.; Bertogna, Marko. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - 65:5(2016), pp. 1593-1605. [10.1109/TC.2015.2444833]

Schedulability Analysis of Hierarchical Real-Time Systems under Shared Resources

BERTOGNA, Marko
2016

Abstract

Sharing resources in hierarchical real-time systems implemented with reservation servers requires the adoption of special budget management protocols that preserve the bandwidth allocated to a specific component. In addition, blocking times must be accurately estimated to guarantee both the global feasibility of all the servers and the local schedulability of applications running on each component. This paper presents two new local schedulability tests to verify the schedulability of real-time applications running on reservation servers under fixed priority and EDF local schedulers. Reservation servers are implemented with the BROE algorithm. A simple extension to the SRP protocol is also proposed to reduce the blocking time of the server when accessing global resources shared among components. The performance of the new schedulability tests are compared with other solutions proposed in the literature, showing the effectiveness of the proposed improvements. Finally, an implementation of the main protocols on a lightweight RTOS is described, highlighting the main practical issues that have been encountered.
2016
65
5
1593
1605
Schedulability Analysis of Hierarchical Real-Time Systems under Shared Resources / Biondi, Alessandro; Buttazzo, Giorgio C.; Bertogna, Marko. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - 65:5(2016), pp. 1593-1605. [10.1109/TC.2015.2444833]
Biondi, Alessandro; Buttazzo, Giorgio C.; Bertogna, Marko
File in questo prodotto:
File Dimensione Formato  
TC15.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 934.57 kB
Formato Adobe PDF
934.57 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
TC15.pdf

Open access

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 239.12 kB
Formato Adobe PDF
239.12 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1118745
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 28
  • ???jsp.display-item.citation.isi??? 24
social impact