Supporting Nested Resources in MrsP

Garrido, Jorge; Zhao, Shuai; Burns, Alan; Wellings, Andy

doi:10.1007/978-3-319-60588-3_5

Cited by 16 publications

(22 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], MrsP is applied to Ada with a prototype outside-kernel implementation. In [17], a complete definition of nested resources behaviour in MrsP is presented with sufficient analysis based on the original MrsP Response Time Analysis (RTA).…”

Section: B Related Workmentioning

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)

Self Cite

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%

“…However, due to the complexity of the topic in this paper and the page limit, this paper focuses on presenting our results for the non-nested case. The results of our research into nested resource access is presented in an independent paper [17].…”

Section: System and Task Modelmentioning

confidence: 99%

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)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Amongst existing multiprocessor resource sharing protocols, early efforts in locking protocols map mainly to extensions of uniprocessor protocols, such as MPCP by Rajkumar et al (1988) and MSRP by Block et al (2007). However, these protocols assume a restricted resource-accessing model, where nested accesses to shared resources is not allowed (Garrido et al, 2017b). Such restrictions are relaxed later on by protocols proposed explicitly for multiprocessors, which assume a more flexible resource-accessing model with nested resources allowed and deadlocks avoided (Ward and Anderson, 2012a;Burns and Wellings, 2013).…”

Section: Introductionmentioning

confidence: 99%

“…With this feature, MrsP has attracted notable attention, as relevant previous research and practitioners' results from PCP (e.g., the deadlock-free mechanism and the analysis techniques (Sha et al, 1990;Audsley et al, 1993;Burns and Wellings, 2016)) can be easily applied to MrsP with minor modifications, thus easing the adoption of multiprocessor platforms for hard real-time systems (Burns and Wellings, 2013). The current version of MrsP contains a complete nested resource accessing model with a simple analysis that provides an upper blocking bound (Garrido et al, 2017b). A short configurable non-preemptive section has been introduced in its helping mechanism that effectively reduces the number of task migrations required for each resource access.…”

Section: Introductionmentioning

confidence: 99%

“…However, with the presence of nested resource accesses, the current analysis of MrsP by Garrido et al (2017b) carries considerable pessimism compared to the state-of-the-art analysis techniques (Wieder and Brandenburg, 2013; due to the issue of over-calculating the time required to execute critical sections (see Section 3.4). In addition, as illustrated in , the potential cost of task migrations has a non-trivial impact on MrsP schedulability, and this is not considered in the analysis for nested resources.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A complete run-time overhead-aware schedulability analysis for MrsP under nested resources

Zhao

Garrido

Wei

et al. 2020

Journal of Systems and Software

Self Cite

View full text Add to dashboard Cite

Multiprocessor Resource Sharing Protocol (MrsP) is a hard real-time multiprocessor resource sharing protocol for fully partitioned fixed-priority systems, and adopts a novel helping mechanism to allow task migrations during resource accessing. Previous research focusing on analysing MrsP systems have delivered two forms of timing analysis which effectively bound response time and migration cost of tasks under MrsP, and have demonstrated advantages of this protocol. An adjustable non-preemptive section is also introduced that effectively reduces the number of migrations needed during each resource access. However, these analysis methods are only applicable if a non-nested resource accessing model is assumed. In addition, there is no clear approach towards the configuration of the non-preemptive section length, and the computation cost for applying the analysis remains unknown. In this paper, we extend the MrsP analysis for systems with nested resources. Major run-time costs incurred by MrsP tasks are also taken into account to form a complete run-time cost-aware schedulability analysis. In addition, recommendations towards non-preemptive section configuration are given from both analytic and empiric perspectives. Finally, a set of evaluations are conducted to investigate schedulability of MrsP under nested resources and the cost for applying the proposed analysis. As a result of this paper, the schedulability test for MrsP is complete and the computation costs of its use are now understood.

show abstract