TY - JOUR
T1 - Supporting single and multi-core resource access protocols on object-oriented RTOSes
AU - dos Santos, Lucas Matheus
AU - Gracioli, Giovani
AU - Kloda, Tomasz
AU - Caccamo, Marco
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2023/6
Y1 - 2023/6
N2 - Real-time resource access protocols are fundamental to bound the maximum delay a task can suffer due to priority inversions. Several real-time protocols have been proposed, for both static and dynamic scheduling approaches in single and multi-core processors. One of the main factors for performance efficiency in such protocols is the way they are implement within a real-time operating system (RTOS). In this paper we present an object-oriented design of real-time access protocols considering single and multi-core systems and also suspension- and spin-based protocols (7 protocols in total). Our design aims at reducing the run-time overhead and increasing code re-usability. By implementing the proposed design in an RTOS and running the protocols in a modern multi-core processor, we provide an analysis regarding the memory footprint, run-time overhead, and the impact of the overhead into the schedulability analysis of synthetically generated task sets. Our results indicate that proper implementation provides low run-time overhead (up to 6.1 μ s) and impact on the schedulability of real-time tasks.
AB - Real-time resource access protocols are fundamental to bound the maximum delay a task can suffer due to priority inversions. Several real-time protocols have been proposed, for both static and dynamic scheduling approaches in single and multi-core processors. One of the main factors for performance efficiency in such protocols is the way they are implement within a real-time operating system (RTOS). In this paper we present an object-oriented design of real-time access protocols considering single and multi-core systems and also suspension- and spin-based protocols (7 protocols in total). Our design aims at reducing the run-time overhead and increasing code re-usability. By implementing the proposed design in an RTOS and running the protocols in a modern multi-core processor, we provide an analysis regarding the memory footprint, run-time overhead, and the impact of the overhead into the schedulability analysis of synthetically generated task sets. Our results indicate that proper implementation provides low run-time overhead (up to 6.1 μ s) and impact on the schedulability of real-time tasks.
KW - MrsP
KW - Priority ceiling protocol
KW - Priority inheritance protocol
KW - Real-time operating systems
KW - Real-time resource access protocols
KW - Stack resource policy
UR - http://www.scopus.com/inward/record.url?scp=85149064356&partnerID=8YFLogxK
U2 - 10.1007/s10617-023-09268-6
DO - 10.1007/s10617-023-09268-6
M3 - Article
AN - SCOPUS:85149064356
SN - 0929-5585
VL - 27
SP - 31
EP - 50
JO - Design Automation for Embedded Systems
JF - Design Automation for Embedded Systems
IS - 1-2
ER -