Multiprocessor Real-Time Locking Protocols for Replicated Resources

Nemitz, Catherine E.; Yang, Kecheng; Yang, Ming–Hsuan; Ekberg, Pontus; Anderson, James H.

doi:10.1109/ecrts.2016.29

Cited by 10 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is, strictly speaking a KX algorithm blocks a task until it may use some replica, but it usually is also necessary to quickly resolve exactly which replica a task is supposed to use. To this end, Nemitz et al [157] introduced several algorithms for the k-exclusion replica assignment problem, with the proposed algorithms representing different tradeoffs w.r.t. optimality considerations and overheads in practice [157].…”

Section: Elliott and Anderson Considered Globally Scheduled Multiproc...mentioning

confidence: 99%

See 1 more Smart Citation

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: Elliott and Anderson Considered Globally Scheduled Multiproc...mentioning

confidence: 99%

“…To this end, Nemitz et al [157] introduced several algorithms for the k-exclusion replica assignment problem, with the proposed algorithms representing different tradeoffs w.r.t. optimality considerations and overheads in practice [157].…”

Section: Elliott and Anderson Considered Globally Scheduled Multiproc...mentioning

confidence: 99%

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Brandenburg

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…For instance, an analogous analysis approach for G-FIFO has been adopted in [38] and [12]. With the above results in place, it is finally possible to present the main theorem of this section.…”

Section: Theorem 4 (From [1])mentioning

confidence: 99%

“…To the best of our knowledge, no efficient and exact analysis for G-FIFO is available. Due to this fact, similarly to G-FP and G-EDF, some authors derived a sufficient analysis by leveraging a 1/m-based interference bound, e.g., as done in [38] and [12].…”

Section: Introductionmentioning

confidence: 99%

On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling

Biondi

Sun

2018

Real-Time Syst

View full text Add to dashboard Cite

Enormous efforts have been spent in the derivation of sufficient schedulability tests for popular global schedulers such as global fixed-priority (G-FP) and global earliest-deadline first (G-EDF). Among all the proposals, response-time analysis techniques are established as the most popular ones and have been widely adopted by several authors in subsequent researches. Such tests are based on interference bounds that have been derived by exploiting the work-conserving property of such schedulers, and are typically expressed with a 1/m multiplier in the interference equation (with m being the number of available processors).

show abstract