An optimal spin-lock priority assignment algorithm for real-time multi-core systems

Afshar, Sara; Behnam, Moris; Bril, Reinder J.; Nolte, Thomas

doi:10.1109/rtcsa.2017.8046310

Cited by 13 publications

(6 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We used similar configurations as in Section 9.2 to generate the task sets. For the tasks that share the same semaphore, they have the same period in the range of [1,10].…”

Section: Evaluations For Periodic Task Setsmentioning

confidence: 99%

“…For priority assignment, most of the results in the literature use rate-monotonic (RM) or earliest-deadline-first (EDF) scheduling. To the best of our knowledge, the priority assignment for systems with shared resources has only been seriously explored in a small numbers of papers, e.g., relative deadline assignment under release enforcement in [44], priority assignment for spinning [1], reasonable priority assignments under global scheduling [17], and the optimal priority assignment used in the greedy slack algorithm in [49]. However, no theoretical evidence has been provided to quantify the nonoptimality of the above heuristics.…”

Section: Introductionmentioning

confidence: 99%

“…The design of synchronization protocols for real-time tasks on multiprocessor platforms started with the distributed priority ceiling protocol (DPCP) [39], followed by the multiprocessor priority ceiling protocol (MPCP) [38]. 1 The MPCP is based on partitioned fixed-priority scheduling and adopts the PCP for local resources. When requesting global resources that are shared by several tasks on different processors, the MPCP executes the corresponding critical sections with priority boosting.…”

Section: Introductionmentioning

confidence: 99%

“…Regarding task partitioning, Lakshmanan et al [28] presented a synchronization-aware partitioned heuristic for the MPCP, which organizes the tasks that share common resources into groups and attempts to assign each group of tasks to the same processor. Following the same principle, Nemati et al [34] presented a blocking-aware partitioning method 1 Neither of these two protocols had a concrete name in the original papers. In the literature, most authors referred to the protocols in [39] as DPCP and [38] as MPCP, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Chen

Brüggen

Shi

et al. 2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

Over the years, many multiprocessor locking protocols have been designed and analyzed. However, the performance of these protocols highly depends on how the tasks are partitioned and prioritized and how the resources are shared locally and globally. This paper answers a few fundamental questions when realtime tasks share resources in multiprocessor systems. We explore the fundamental difficulty of the multiprocessor synchronization problem and show that a very simplified version of this problem is N P -hard in the strong sense regardless of the number of processors and the underlying scheduling paradigm. Therefore, the allowance of preemption or migration does not reduce the computational complexity. For the positive side, we develop a dependency-graph approach, that is specifically useful for framebased real-time tasks, in which all tasks have the same period and release their jobs always at the same time. We present a series of algorithms with speedup factors between 2 and 3 under semi-partitioned scheduling. We further explore methodologies and tradeoffs of preemptive against non-preemptive scheduling algorithms and partitioned against semi-partitioned scheduling algorithms. The approach is extended to periodic tasks under certain conditions.

show abstract

“…We used similar configurations as in Section 9.2 to generate the task sets. For the tasks that share the same semaphore, they have the same period in the range of [1,10].…”

Section: Evaluations For Periodic Task Setsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Chen

Brüggen

Shi

et al. 2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

show abstract

“…Afshar et al combined this observation with (unconditional) priority boosting and FIFO-ordered spin locks into a flexible spin-lock model (FSLM) [1,5] that can be tuned [11] to resemble either the MSRP [90],…”

Section: Spin-lock Protocols Based On Priority Boostingmentioning

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