Improved task packing for shared resources in multiprocessor real-time systems scheduled by RUN under SBLP

Teixeira, Ricardo Brasil; Lima, George

doi:10.1109/sbesc49506.2019.9046074

Cited by 5 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They concluded that the lock-free synchronization approach offers advantages on asymmetric multiprocessing platforms. Recently, Teixeira and Lima [40] proposed a task allocation heuristic for global scheduling that leverages the concept of servers [41]. Yang et al proposed new more precise schedulability analyses based on linear programming for several multiprocessor semaphore-based locking approaches [4].…”

Section: Related Workmentioning

confidence: 99%

Supporting Single and Multi-Core Resource Access Protocols on Object-Oriented RTOSes

Santos

Gracioli

Kloda

et al. 2022

Preprint

View full text Add to dashboard Cite

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 increasingcode 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 us) and impact on the schedulability of real-time tasks.

show abstract

Section: Related Workmentioning

confidence: 99%

Supporting Single and Multi-Core Resource Access Protocols on Object-Oriented RTOSes

Santos

Gracioli

Kloda

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

Supporting single and multi-core resource access protocols on object-oriented RTOSes

Santos

Gracioli

Kloda

et al. 2023

Des Autom Embed Syst

View full text Add to dashboard Cite

Shared resources in multiprocessor real-time systems scheduled by RUN

Teixeira

Lima

2021

Real-Time Syst

Self Cite

View full text Add to dashboard Cite

A hard real-time system can be defined as the one that at least one of its tasks must meet its deadlines whenever the system is running. This requirement makes the scheduling algorithm a key element for system correctness. Ideally, the scheduling algorithm employed must both exhibit low overhead (efficiency) and ensure that no task deadline is missed whenever this can be ensured by some scheduling algorithm (optimality). RUN (Reduction to Uniprocessor) is an algorithm capable of efficiently and optimally scheduling a set of strictly periodic tasks on a multiprocessor platform when tasks do not share any resources but processors. Although it has already been shown that RUN is compatible with resource sharing, the only existing solution prevents preemptive access to shared resources. Unlike this approach, which can be considered too restrictive due to its poor schedulability, we used MrsP (Multiprocessor resource sharing Protocol) as a more flexible resource sharing mechanism. Making the rules of both RUN and MrsP compatible to each other was thus our main goal. The derived solution was implemented on Linux Textbed for Multiprocessor Scheduling in Real-Time systems (Litmus-RT), namely a Linux-based real-time operating system. We proposed a new task packaging heuristic and performed experimental evaluations comparing our solution with the existing one. The results showed that the proposed solution presented better results in terms of schedulability, total overhead and number of migrations and preemptions.

show abstract

Improved task packing for shared resources in multiprocessor real-time systems scheduled by RUN under SBLP

Cited by 5 publications

References 22 publications

Supporting Single and Multi-Core Resource Access Protocols on Object-Oriented RTOSes

Supporting Single and Multi-Core Resource Access Protocols on Object-Oriented RTOSes

Supporting single and multi-core resource access protocols on object-oriented RTOSes

Shared resources in multiprocessor real-time systems scheduled by RUN

Contact Info

Product

Resources

About