Locking in Pfair-Scheduled Multiprocessor Systems

Authors:
Philip Holman;James H. Anderson
Affiliations:
-;-
Venue:
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Year:
2002

Citing 0
Cited 6

Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
Group-Based Pfair Scheduling

Real-Time Systems
Locking under Pfair scheduling

ACM Transactions on Computer Systems (TOCS)
Supporting lock-free synchronization in Pfair-scheduled real-time systems

Journal of Parallel and Distributed Computing
Efficient scheduling of soft real-time applications on multiprocessors

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Adapting Pfair scheduling for symmetric multiprocessors

Journal of Embedded Computing - Cache exploitation in embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider two classes of locking synchronization protocols for Pfair-scheduled multiprocessor systems: short critical-section protocols and long critical-section protocols. For the former class, we demonstrate that efficient synchronization can be achieved by ensuring that all locks have been released before tasks are preempted. For the latter class, we propose the use of statically-weighted resource servers. We also discuss several inheritance-based protocols as possible alternatives.