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šorn B. Brandenburg and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
This paper presents the first suspension-based real-time lock-
ing protocols 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 fundamentally different means for bound-
ing priority inversions. A new mechanism to bound such in-
versions, termed priority donation, is presented and used to
derive protocols for mutual exclusion, reader-writer exclu-
sion, and k-exclusion. Each protocol has asymptotically op-
timal blocking bounds under certain analysis assumptions.
The latter two protocols are also the first of their kind for the
special cases of global and partitioned scheduling.
1 Introduction
Recent experimental work has demonstrated the effective-
ness of clustered scheduling on large multicore, multi-chip

  

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

 

Collections: Computer Technologies and Information Sciences