Multiprocessor Real-Time Locking Protocols: A Systematic Review

TL;DR

This paper systematically reviews multiprocessor real-time locking protocols from 1988 to 2018, analyzing progress mechanisms, synchronization types, and analysis approaches, with a focus on suspension-aware and suspension-oblivious methods.

Contribution

It provides a comprehensive synthesis of the literature on analytically sound multiprocessor real-time locking protocols, highlighting recent advances and optimality criteria.

Findings

Analysis of suspension-oblivious and suspension-aware protocols

Identification of lower bounds on priority-inversion blocking

Comparison of optimality criteria for locking protocols

Abstract

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, spin-lock protocols, binary semaphore protocols, independence-preserving (or fully preemptive) locking protocols, reader-writer and k-exclusion synchronization, support for nested critical sections, and implementation and system-integration aspects. 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.