Exploring the design space of multiprocessor synchronization protocols for real-time systems

Carminati, Andreu; Friedrich, Luis Fernando

doi:10.1016/j.sysarc.2013.11.010

Cited by 10 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several authors have reported on MPCP implementations. In work targeting Linux with the PREEMPT_RT patch, Carminati et al [59] provided details on in-kernel implementations of the FMLP [33] and a non-preemptive MPCP variant [58]. A particularly low-overhead implementation of the MPCP for micro-controllers that avoids the need for expensive wait-queue manipulations was proposed by Müller et al [145].…”

Section: Rtos and Programming Language Integrationmentioning

confidence: 99%

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Brandenburg

2019

Preprint

View full text Add to dashboard Cite

We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics:• progress mechanisms that prevent the lock-holder preemption problem (Section 3),• spin-lock protocols (Section 4),• binary semaphore protocols (Sections 5 and 6),• independence-preserving (or fully preemptive) locking protocols (Section 7),• reader-writer and k-exclusion synchronization (Section 8),• support for nested critical sections (Section 9), and • implementation and system-integration aspects (Section 10).A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds on maximum priority-inversion blocking, and matching asymptotically optimal locking protocols.

show abstract

Section: Rtos and Programming Language Integrationmentioning

confidence: 99%

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Brandenburg

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…the decomposition of the task strongly influences the cost and performance of the whole multiprocessing system. Therefore, comparing and evaluating the effects of different task decompositions performed by applying systematic algorithms may help the designer to approach the optimal decisions in the system-level synthesis phase [4]. Our proposed method can also be considered a design space exploration as shown in [3][4][5].…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…Therefore, comparing and evaluating the effects of different task decompositions performed by applying systematic algorithms may help the designer to approach the optimal decisions in the system-level synthesis phase [4]. Our proposed method can also be considered a design space exploration as shown in [3][4][5]. In [5] the hardware-software partitioning problem is analyzed and various solutions are compared and evaluated.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A Method for Generating, Evaluating and Comparing Various System-level Synthesis Results in Designing Multiprocessor Architectures

Arató¹,

Rácz²

2018

Adv. sci. technol. eng. syst. j.

View full text Add to dashboard Cite

Multiprocessing can be considered the most characteristic common property of complex digital systems. Due to the more and more complex tasks to be solved for fulfilling often conflicting requirements (cost, speed, energy and communication efficiency, pipelining, parallelism, the number of component processors, etc.), different types of component processors may be required by forming a so called Heterogeneous Multiprocessing Architecture (HMPA). The component processors of such systems may be not only general purpose CPUs or cores, but also DSPs, GPUs, FPGAs and other custom hardware components as well. Nevertheless, the system-level design process should be capable to handle the different types of component processors the same generic way. The hierarchy of the component processors and the data transfer organization between them are strongly determined by the task to be solved and by the priority order of the requirements to be fulfilled. For each component processor, a subtask must be defined based on the requirements and their desired priority orders. The definition of the subtasks, i.e. the decomposition of the task influences strongly the cost and performance of the whole system. Therefore, systematically comparing and evaluating the effects of different decompositions into subtasks may help the designer to approach optimal decisions in the system-level synthesis phase. For this purpose, the paper presents a novel method called DECHLS based on combining the decomposition and the modified high level synthesis algorithms. The application of the method is illustrated by redesigning and evaluating in some versions of two existing high performance practical embedded multiprocessing systems.

show abstract

“…The recent report by Chen et al [11] and the report by Bletsas et al [4] have shown that several analyses in the state-of-the-art of self-suspending tasks [1], [2], [20], [27] are in fact unsafe. Unfortunately, those misconceptions propagated to several works [6], [7], [13], [19], [22], [30]- [32] analyzing the worst-case response time for partitioned multiprocessor real-time locking protocols. Moreover, Liu and Chen in [23] provided a utilization-based schedulability test based on a hyperbolic-form.…”

Section: Introductionmentioning

confidence: 99%

A Unifying Response Time Analysis Framework for Dynamic Self-Suspending Tasks

Chen

Nelissen

Huang

2016

2016 28th Euromicro Conference on Real-Time Systems (ECRTS)

View full text Add to dashboard Cite

For real-time embedded systems, self-suspending behaviors can cause substantial performance/schedulability degradations. In this paper, we focus on preemptive fixed-priority scheduling for the dynamic self-suspension task model on uniprocessor. This model assumes that a job of a task can dynamically suspend itself during its execution (for instance, to wait for shared resources or access co-processors or external devices). The total suspension time of a job is upper-bounded, but this dynamic behavior drastically influences the interference generated by this task on lower-priority tasks. The state-of-the-art results for this task model can be classified into three categories (i) modeling suspension as computation, (ii) modeling suspension as release jitter, and (iii) modeling suspension as a blocking term. However, several results associated to the release jitter approach have been recently proven to be erroneous, and the concept of modeling suspension as blocking was never formally proven correct. This paper presents a unifying response time analysis framework for the dynamic self-suspending task model. We provide a rigorous proof and show that the existing analyses pertaining to the three categories mentioned above are analytically dominated by our proposed solution. Therefore, all those techniques are in fact correct, but they are inferior to the proposed response time analysis in this paper. The evaluation results show that our analysis framework can generate huge improvements (an increase of up to 50% of the number of task sets deemed schedulable) over these state-of-the-art analyses.A Unifying Response Time Analysis Framework for Dynamic Self-Suspending TasksJian-Jia Chen * , Geoffrey Nelissen § , Wen-Hung Huang * * TU Dortmund University, Germany § CISTER/INESC-TEC, ISEP, Polytechnic Institute of Porto, Portugal Emails: {jian-jia.chen, wen-hung.huang}@tu-dortmund.de, grrpn@isep.ipp.pt Abstract-For real-time embedded systems, self-suspending behaviors can cause substantial performance/schedulability degradations. In this paper, we focus on preemptive fixed-priority scheduling for the dynamic self-suspension task model on uniprocessor. This model assumes that a job of a task can dynamically suspend itself during its execution (for instance, to wait for shared resources or access co-processors or external devices). The total suspension time of a job is upper-bounded, but this dynamic behavior drastically influences the interference generated by this task on lower-priority tasks. The state-of-the-art results for this task model can be classified into three categories (i) modeling suspension as computation, (ii) modeling suspension as release jitter, and (iii) modeling suspension as a blocking term. However, several results associated to the release jitter approach have been recently proven to be erroneous, and the concept of modeling suspension as blocking was never formally proven correct. This paper presents a unifying response time analysis framework for the dynamic self-suspending task model. We pr...

show abstract

Exploring the design space of multiprocessor synchronization protocols for real-time systems

Cited by 10 publications

References 16 publications

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Multiprocessor Real-Time Locking Protocols: A Systematic Review

A Method for Generating, Evaluating and Comparing Various System-level Synthesis Results in Designing Multiprocessor Architectures

A Unifying Response Time Analysis Framework for Dynamic Self-Suspending Tasks

Contact Info

Product

Resources

About