Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Real-Time Resource-Sharing under Clustered Scheduling: Mutex, Reader-Writer, and k-Exclusion Locks
 

Summary: Real-Time Resource-Sharing under Clustered Scheduling:
Mutex, Reader-Writer, and k-Exclusion Locks
Björn B. Brandenburg
Department of Computer Science
University of North Carolina at Chapel Hill
bbb@cs.unc.edu
James H. Anderson
Department of Computer Science
University of North Carolina at Chapel Hill
anderson@cs.unc.edu
ABSTRACT
This paper presents the first suspension-based real-time locking pro-
tocols for clustered schedulers. Such schedulers pose challenges
from a locking perspective because they exhibit aspects of both
partitioned and global scheduling, which seem to necessitate funda-
mentally different means for bounding priority inversions. A new
mechanism to bound such inversions, termed priority donation, is
presented and used to derive protocols for mutual exclusion, reader-
writer exclusion, and k-exclusion. Each protocol has asymptotically
optimal blocking bounds under certain analysis assumptions. The

  

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

 

Collections: Computer Technologies and Information Sciences