Locking in pfair-scheduled multiprocessor systems

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.