A Blocking Bound for Nested FIFO Spin Locks

Biondi, Alessandro; Brandenburg, Björn B.; Wieder, Alexander

doi:10.1109/rtss.2016.036

Cited by 18 publications

(22 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, Wieder and Brandenburg's work [8], [29] gave a more precise schedulability test for MSRP. More recently, Biondi et al [6] presented the first analysis for nested resource access for FIFO spin locks, which can also be directly applied to MSRP. In contrast, the FMLP [7] protocol introduced the notion of resource groups, where resources are grouped based on the length of resources.…”

Section: B Related Workmentioning

confidence: 99%

“…The arrival blocking is accounted for by parameter B i (equation 6), where e i gives the maximum arrival blocking that τ i can incur and is calculated by equation 7.…”

Section: Arrival Blockingmentioning

confidence: 99%

“…0, otherwise (15) Same with the arrival blocking, such a blocking happens before the execution of τ i and can only happen once, equation 6 should be modified to reflect this extra blocking.…”

Section: Theoremmentioning

confidence: 99%

See 2 more Smart Citations

New schedulability analysis for MrsP

Zhao

Garrido

Burns

et al. 2017

2017 IEEE 23rd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

Abstract-In this paper we consider a spin-based multiprocessor locking protocol, named the Multiprocessor resource sharing Protocol (MrsP). MrsP adopts a helping-mechanism where the preempted resource holder can migrate. The original schedulability analysis of MrsP carries considerable pessimism as it has been developed assuming limited knowledge of the resource usage for each remote task. In this paper new MrsP schedulability analysis is developed that takes into account such knowledge to provide a less pessimistic analysis than that of the original analysis. Our experiments show that, theoretically, the new analysis offers better (at least identical) schedulability than the FIFO non-preemptive protocol, and can outperform FIFO preemptive spin locks under systems with either intensive resource contention or long critical sections.The paper also develops analysis to include the overhead of MrsP's helping mechanism. Although MrsP's helping mechanism theoretically increases schedulability, our evaluation shows that this increase may be negated when the overheads of migrations are taken into account. To mitigate this, we have modified the MrsP protocol to introduce a short non-preemptive section following migration. Our experiments demonstrate that with migration cost, MrsP may not be favourable for short critical sections but provides a better schedulability than other FIFO spin-based protocols when long critical sections are applied.

show abstract

Section: B Related Workmentioning

confidence: 99%

“…The arrival blocking is accounted for by parameter B i (equation 6), where e i gives the maximum arrival blocking that τ i can incur and is calculated by equation 7.…”

Section: Arrival Blockingmentioning

confidence: 99%

See 1 more Smart Citation

New schedulability analysis for MrsP

Zhao

Garrido

Burns

et al. 2017

2017 IEEE 23rd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

show abstract

“…Note that we also need to consider indirect (transitive) blocking (cf. B i in Figure 6), which has most recently been described in [6]. Transitive blocking occurs when there is a task τ j which blocks another execution context from τ i and which is no strict predecessor or successor of the latter.…”

Section: Event-count Boundsmentioning

confidence: 99%

“…Negrean and Ernst [14] considered a nested locking of global and local resources that induced additional blocking on local tasks. The crucial effects of nested locks and the resulting transitive blocking have most recently been studied by Biondi et al [6]. Nevertheless, to the best of our knowledge the existing literature always assumes that shared resources are released upon task/job completion (or segments in case of MAST), which is a reasonable assumption in the context of shared resources in multiprocessors systems but only of limited applicability in our scenario.…”

Section: Related Workmentioning

confidence: 99%

Response-Time Analysis for Task Chains with Complex Precedence and Blocking Relations

Schlatow

Ernst

2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

For the development of complex software systems, we often resort to component-based approaches that separate the different concerns, enhance verifiability and reusability, and for which microkernel-based implementations are a good fit to enforce these concepts. Composing such a system of several interacting software components will, however, lead to complex precedence and blocking relations, which must be taken into account when performing latency analysis. When modelling these systems by classical task graphs, some of these effects are obfuscated and tend to render such an analysis either overly pessimistic or even optimistic. We therefore firstly present a novel task (meta-)model that is more expressive and accurate w.r.t. these (functional) precedence and mutual blocking relations. Secondly, we apply the busy-window approach and formulate a modular response-time analysis on task-chain level suitable but not restricted to static-priority scheduled systems. We show that the conjunction of both concepts allows the calculation of reasonably tight latency bounds for scenarios not adequately covered by related work. CCS Concepts: • Computer systems organization → Real-time systems; Embedded and cyber-physical systems;

show abstract

Supporting Nested Resources in MrsP

Garrido

Zhao

Burns

et al. 2017

Reliable Software Technologies – Ada-Europe 2017

View full text Add to dashboard Cite

The original MrsP proposal presented a new multiprocessor resource sharing protocol based on the properties and behaviour of the Priority Ceiling Protocol, supported by a novel helping mechanism. While this approach proved to be as simple and elegant as the single processor protocol, the implications with regard to nested resources was identified as requiring further clarification. In this work we present a complete approach to nested resources behaviour and analysis for the MrsP protocol. 3

show abstract

A Blocking Bound for Nested FIFO Spin Locks

Cited by 18 publications

References 12 publications

New schedulability analysis for MrsP

New schedulability analysis for MrsP

Response-Time Analysis for Task Chains with Complex Precedence and Blocking Relations

Supporting Nested Resources in MrsP

Contact Info

Product

Resources

About