Locking in Pfair-Scheduled Multiprocessor Systems

We present several locking synchronization protocols and associated schedulability conditions for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The rst class is only applicable in systems in which all critical sections are short relative to the length of the scheduling quantum. In this case, e cient synchronization can be achieved by ensuring that all locks have been released before tasks are preempted. The second and more general protocol class is applicable to any system. For this class, we propose the use of statically-weighted resource servers. We also discuss several inheritance-based protocols as possible alternatives. Work supported by NSF grants CCR 9972211, CCR 9988327, and ITR 0082866. 

• Type: Conference
• Year: 2002
• Where: RTSS
• Authors: Philip Holman, James H. Anderson
• Keywords: Associated Schedulability Conditions, Control Systems, Pfair-scheduled Multiprocessor Systems, RTSS 2002, Synchronization Protocols