Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Spin-Based Reader-Writer Synchronization for Multiprocessor Real-Time Systems
 

Summary: Spin-Based Reader-Writer Synchronization
for Multiprocessor Real-Time Systems
Bjšorn B. Brandenburg James H. Anderson
July 2010
Abstract
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause
undue blocking in multiprocessor real-time systems. Phase-fair reader writer locks, a new
class of reader-writer locks, are proposed as an alternative. Three local-spin phase-fair
lock algorithms, one with constant remote-memory-reference complexity, are presented and
demonstrated to be efficiently implementable on common hardware platforms. Both task-
and phase-fair locks are evaluated and contrasted to mutex locks in terms of hard and soft
real-time schedulability--each under both global and partitioned scheduling--under con-
sideration of runtime overheads on a multicore Sun "Niagara" UltraSPARC T1 processor.
Formal bounds on worst-case blocking are derived for all considered lock types.
1 Introduction
With the transition to multicore architectures by most (if not all) major chip manufacturers, mul-
tiprocessors are now a standard deployment platform for (soft) real-time applications. This has
led to renewed interest in real-time multiprocessor scheduling and synchronization algorithms
(see (Brandenburg and Anderson, 2008; Brandenburg et al., 2008a,b; Calandrino et al., 2006) for
recent comparative studies and relevant references). However, prior work on synchronization

  

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

 

Collections: Computer Technologies and Information Sciences