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, 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.
Authors
- Zelin Tong (ORCID: https://orcid.org/0000-0002-4697-8747)
- Syed Qaseem Ali (ORCID: https://orcid.org/0000-0002-9212-2608)
- James H. Anderson (ORCID: https://orcid.org/0000-0001-7138-939X)
Institutions
- University of North Carolina at Chapel Hill (US)
Publication Details
- Published
- 2025-05-06
- DOI
- https://doi.org/10.1109/rtas65571.2025.00007
- Citations
- 1
- Primary Topic
- Real-Time Systems Scheduling
- Type
- article
- Field-Weighted Citation Impact
- 2.27
Funders
- National Science Foundation