Asymptotically Optimal Multiprocessor Real-Time Locking for non-JLFP Scheduling

In prior work, a number of asymptotically optimal suspension-based real-time locking protocols have been presented for job-level fixed priority (JLFP) schedulers, where job priorities do not change. However, the optimality proofs for these locking protocols break down under non-JLFP scheduling, wher...

Full description

Saved in:
Bibliographic Details
Published inProceedings / IEEE Real-Time and Embedded Technology and Applications Symposium pp. 1 - 12
Main Authors Tong, Zelin, Ali, Syed, Anderson, James H.
Format Conference Proceeding
LanguageEnglish
Published IEEE 06.05.2025
Subjects
locking
locking protocol
Lower bound
optimality
pi-blocking
Protocols
real-time
Real-time systems
Synchronization
Online AccessGet full text

Cover

More Information
Summary:In prior work, a number of asymptotically optimal suspension-based real-time locking protocols have been presented for job-level fixed priority (JLFP) schedulers, where job priorities do not change. However, the optimality proofs for these locking protocols break down under non-JLFP scheduling, where job priorities can vary. In fact, the problem of designing an asymptotically optimal real-time locking protocol for general non-JLFP scheduling has remained open. This paper closes this problem by presenting the non-JLFP locking protocol (NJLP), the first asymptotically optimal suspension-based real-time locking protocol for non-JLFP schedulers.
ISSN:2642-7346
DOI:10.1109/RTAS65571.2025.00007