An asymptotically optimal real-time locking protocol for clustered scheduling under suspension-aware analysis

Authors:
Björn B. Brandenburg
Affiliations:
Max Planck Institute for Software Systems (MPI-SWS)
Venue:
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Year:
2013

Citing 4
Cited 0

Synchronization in Real-Time Systems: A Priority Inheritance Approach

Synchronization in Real-Time Systems: A Priority Inheritance Approach
A Flexible Real-Time Locking Protocol for Multiprocessors

RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Optimality Results for Multiprocessor Real-Time Locking

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Scheduling and locking in multiprocessor real-time operating systems

Scheduling and locking in multiprocessor real-time operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of real-time locking protocols is to limit priority inversions [5], which, intuitively, occur when a high-priority task is delayed by a lower-priority task. Such locking-related delay, also called priority inversion blocking (pi-blocking), is problematic in real-time systems because it can result in deadline misses. However, some pi-blocking is unavoidable when using locks and thus must be bounded and accounted for during schedulability analysis.