Global Real-Time Semaphore Protocols: A Survey, Unified Analysis, and Comparison

Yang, Maolin; Wieder, Alexander; Brandenburg, Björn B.

doi:10.1109/rtss.2015.8

Cited by 33 publications

(30 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Under the SRP, task τ i can be blocked only by critical sections of a lower-priority task τ j (iterated over with the first multiset union) related to a resource ℓ k with ceiling π(ℓ k ) ≥ π i (iterated over with the second multiset union). Furthermore, τ j may execute at most η j (t, R) different jobs in any time interval of length t [22]. By definition of N j,k , each job of τ j has at most N j,k critical sections related to resource ℓ k .…”

Section: B More Accurate Blocking Analysismentioning

confidence: 99%

“…State-of-the-art analyses for multiprocessor locking protocols have adopted a similar technique to our more accurate blocking analysis of the SRP, to characterize the set of critical sections that can effectively block higher priority tasks [22], [27]: this approach is typically referred to as inflation-free analysis, and was first proposed by Brandenburg in [13].…”

Section: Related Workmentioning

confidence: 99%

“…Works on semaphore-based multiprocessor locking protocols [13], [28] also considered the integration of blocking with self-suspensions, but under the case in which suspensions are originated by waiting times for resources locked on a remote processor or when suspensions happen within a critical section (e.g., due to I/O accesses). To the best of our records, there is no work that attempts to mitigate the additional blocking originating from self-suspension, other then by using spinlocks [22], effectively replacing suspension by computation.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

The SRP Resource Sharing Protocol for Self-Suspending Tasks

Nelissen

Biondi

2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

Motivated by the increasingly wide adoption of realtimeworkload with self-suspending behaviors, and the relevanceof mechanisms to handle mutually-exclusive shared resources, thispaper takes a new look at locking protocols for self-suspendingtasks under uniprocessor fixed-priority scheduling. Pitfalls whenintegrating the widelyadopted Stack Resource Policy (SRP) withself-suspending tasks are firstly illustrated, and then a new fine grainedSRP analysis is presented. Next, a new locking protocol,named SRP-SS, is proposed to overcome the limitations of theoriginal SRP. The SRP-SS is a generalization of the SRP to copewith the specificities of selfsuspending tasks. It therefore reducesto the SRP under some configurations and hence theoreticallydominates the SRP. It also ensures backward compatibility forapplications developed specifically for the SRP. The SRP-SScomes with its own schedulability analysis and configurationalgorithm. The performances of the SRP and SRP-SS are finallystudied by means of schedulability experiments.

show abstract

Section: B More Accurate Blocking Analysismentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The SRP Resource Sharing Protocol for Self-Suspending Tasks

Nelissen

Biondi

2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

show abstract

“…Many other works exist in the literature() on variants of the aforementioned resource‐sharing protocols and their analysis. A comprehensive overview and comparative evaluation of them can be found in the recent work by Yang et al…”

Section: Related Workmentioning

confidence: 99%

Improving responsiveness of time‐sensitive applications by exploiting dynamic task dependencies

et al. 2017

View full text Add to dashboard Cite

In this paper, a mechanism is presented for reducing priority inversion in multiprogrammed computing systems. Contrary to well-known approaches from the literature, this paper tackles cases where the dependency relationships among tasks cannot be known in advance to the operating system. The presented mechanism allows tasks to explicitly declare aforementioned relationships, enabling the operating system scheduler to take advantage of such information and trigger priority inheritance, resulting in reduced priority inversion.We present the prototype implementation of the concept within the Linux kernel in the form of modifications to the standard Portable Operating System Interface (POSIX) condition variable code, along with an extensive evaluation, including a quantitative assessment of the benefits for applications making use of the technique and comprehensive overhead measurements. In addition, we present an associated technique for the theoretical schedulability analysis of a system using the new mechanism, which is useful to determine whether all tasks can meet their deadlines or not, in the specific scenario of tasks interacting only through remote procedure calls and under partitioned scheduling.

show abstract

“…Among all the proposals, response-time analysis techniques [10] established as very popular and influential, which likely happened because of their "conceptual compatibility" with the pre-existing analysis methods for uniprocessor systems, their higher (empirical) schedulability performance with respect to other sufficient tests (e.g., see [9,43]), and because they have been found easy for being extended. In fact, such techniques have been widely adopted by several authors as a fundamental building block to analyze more complex systems, including the support for global locking protocols [47], hierarchical scheduling [48], mixed-criticality scheduling [39], processor affinities [31] and parallel tasks [20].…”

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

Global Real-Time Semaphore Protocols: A Survey, Unified Analysis, and Comparison

Cited by 33 publications

References 23 publications

The SRP Resource Sharing Protocol for Self-Suspending Tasks

The SRP Resource Sharing Protocol for Self-Suspending Tasks

Improving responsiveness of time‐sensitive applications by exploiting dynamic task dependencies

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

Contact Info

Product

Resources

About