Summary: Locking in Pfair­scheduled Multiprocessor Systems \Lambda
Philip Holman and James H. Anderson
Department of Computer Science
University of North Carolina
Chapel Hill, NC 27599­3175
Phone: (919) 962­1757
Fax: (919) 962­1799
E­mail: fholman, andersong@cs.unc.edu
May 2002
Abstract
We present several locking synchronization protocols and associated schedulability conditions for
Pfair­scheduled 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 statically­weighted resource servers. We also discuss several
inheritance­based protocols as possible alternatives.
\Lambda Work supported by NSF grants CCR 9972211, CCR 9988327, and ITR 0082866.

1 Introduction

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

Collections: Computer Technologies and Information Sciences