Summary: Locking in Pfairscheduled Multiprocessor Systems \Lambda
Philip Holman and James H. Anderson
Department of Computer Science
University of North Carolina
Chapel Hill, NC 275993175
Phone: (919) 9621757
Fax: (919) 9621799
Email: fholman, firstname.lastname@example.org
We present several locking synchronization protocols and associated schedulability conditions for
Pfairscheduled multiprocessor systems. We focus on two classes of protocols. The first class is only
applicable in systems in which all critical sections are short relative to the length of the scheduling
quantum. In this case, efficient 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 staticallyweighted resource servers. We also discuss several
inheritancebased protocols as possible alternatives.
\Lambda Work supported by NSF grants CCR 9972211, CCR 9988327, and ITR 0082866.