Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Locking under Pfair Scheduling PHILIP HOLMAN
 

Summary: Locking under Pfair Scheduling
PHILIP HOLMAN
University of North Carolina at Chapel Hill
and
JAMES H. ANDERSON
University of North Carolina at Chapel Hill
We present several locking synchronization protocols for Pfair-scheduled multiprocessor sys-
tems. 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, effi-
cient synchronization can be achieved by ensuring that all locks have been released before tasks
are preempted. This is accomplished by exploiting the quantum-based nature of Pfair scheduling,
which provides a priori knowledge of all possible preemption points. The second and more general
protocol class is applicable to any system. For this class, we consider the use of a client-server
model. We also discuss the viability of inheritance-based protocols in Pfair-scheduled systems.
Categories and Subject Descriptors: C.3 [Computer Systems Organization]: Special-Purpose
and Application-Based Systems--Real-Time and Embedded Systems; D.4.1 [Operating Sys-
tems]: Process Management--Multiprocessing; Mutual Exclusion; Scheduling; Synchronization;
J.7 [Computer Applications]: Computers in Other Systems--Real time
General Terms: Algorithms, Design
Additional Key Words and Phrases: Locking, Multiprocessor, Pfairness, Real-time, Scheduling,

  

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

 

Collections: Computer Technologies and Information Sciences