TimerShield: Protecting High-Priority Tasks from Low-Priority Timer Interference (Outstanding Paper)

Patel, Parveen; Vanga, Manohar; Brandenburg, Björn B.

doi:10.1109/rtas.2017.40

Cited by 6 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2016, the Linux Foundation started the Real-Time Linux collaborative project. 3 This project aimed at coordinating the development of kernels for the real-time environment and, in particular, the development of the PREEMPT_RT patch, which started in 2005 with the goal to increase the determinism and to reduce latencies of the Linux kernel. The project aimed also at creating a common knowledge base, starting from the already existent rt-wiki.…”

Section: Current Industrial and Scientific Trends In Linux Communitymentioning

confidence: 99%

“…HRTs can be enabled or disabled at compile time via the CONFIG_HIGH_RES_TIMERS configuration flag or at runtime. Recently, Patel et al (2017) analyzed the time unpredictability induced by hrtimers and proposed priority-aware high-resolution timers with a subsystem called TimerShield. Reducing the interrupt interference on high-priority tasks increases the PREEMPT_RT real-time capabilities but at the same time adds overhead due to the use of complex data structures.…”

Section: High-resolution Timersmentioning

confidence: 99%

“…Linux Foundation website: https://www.linuxfoundation.org/. 2 https://www.linuxfoundation.org/membership/members/ 3. Real-Time Linux project website: https://wiki.linuxfoundation.org/realtime.…”

mentioning

confidence: 99%

See 2 more Smart Citations

The Real-Time Linux Kernel

2019

View full text Add to dashboard Cite

The increasing functional and nonfunctional requirements of real-time applications, the advent of mixed criticality computing, and the necessity of reducing costs are leading to an increase in the interest for employing COTS hardware in real-time domains. In this scenario, the Linux kernel is emerging as a valuable solution on the software side, thanks to the rich support for hardware devices and peripherals, along with a well-established programming environment. However, Linux has been developed as a general-purpose operating system, followed by several approaches to introduce actual real-time capabilities in the kernel. Among these, the PREEMPT_RT patch, developed by the kernel maintainers, has the goal to increase the predictability and reduce the latencies of the kernel directly modifying the existent kernel code. This article aims at providing a survey of the state-of-the-art approaches for building real-time Linux-based systems, with a focus on PREEMPT_RT, its evolution, and the challenges that should be addressed in order to move PREEMPT_RT one step ahead. Finally, we present some applications and use cases that have already benefited from the introduction of this patch.

show abstract

Section: Current Industrial and Scientific Trends In Linux Communitymentioning

confidence: 99%

Section: High-resolution Timersmentioning

confidence: 99%

See 1 more Smart Citation

The Real-Time Linux Kernel

2019

View full text Add to dashboard Cite

show abstract

“…Existing work has also investigated the impact of other types of shared resources on real-time performance, including e.g., impacts of Miss Status Holding Registers (MSHR) on partitioned caches [56], interferences due to memory bank contention [31,55,69], TLB interferences [45], and effects of interrupts [13,29,46,49]. As an initial step, our work focuses on interferences due to concurrent cache accesses and shared memory bandwidth, while assuming that the overhead due to other types of interferences has been accounted for in the tasks' WCETs.…”

Section: Related Workmentioning

confidence: 99%

Holistic Resource Allocation for Multicore Real-Time Systems

Phan

Choi

et al. 2019

2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)

View full text Add to dashboard Cite

This paper presents CaM, a holistic cache and memory bandwidth resource allocation strategy for multicore real-time systems. CaM is designed for partitioned scheduling, where tasks are mapped onto cores, and the shared cache and memory bandwidth resources are partitioned among cores to reduce resource interferences due to concurrent accesses. Based on our extension of LITMUS RT with Intel's Cache Allocation Technology and MemGuard, we present an experimental evaluation of the relationship between the allocation of cache and memory bandwidth resources and a task's WCET. Our resource allocation strategy exploits this relationship to map tasks onto cores, and to compute the resource allocation for each core. By grouping tasks with similar characteristics (in terms of resource demands) to the same core, it enables tasks on each core to fully utilize the assigned resources. In addition, based on the tasks' execution time behaviors with respect to their assigned resources, we can determine a desirable allocation that maximizes schedulability under resource constraints. Extensive evaluations using real-world benchmarks show that CaM offers near optimal schedulability performance while being highly efficient, and that it substantially outperforms existing solutions.

show abstract

Precisely Timed Task Execution

Schröder-Preikschat

2020

2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC)

View full text Add to dashboard Cite

TimerShield: Protecting High-Priority Tasks from Low-Priority Timer Interference (Outstanding Paper)

Cited by 6 publications

References 20 publications

The Real-Time Linux Kernel

The Real-Time Linux Kernel

Holistic Resource Allocation for Multicore Real-Time Systems

Precisely Timed Task Execution

Contact Info

Product

Resources

About