Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Reader-Writer Synchronization for Shared-Memory Multiprocessor Real-Time Systems
 

Summary: Reader-Writer Synchronization for
Shared-Memory Multiprocessor Real-Time Systems
Bjšorn B. Brandenburg and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
Reader preference, writer preference, and task-fair reader-
writer locks are shown to cause undue blocking in multipro-
cessor real-time systems. A new phase-fair reader-writer lock
is proposed as an alternative that significantly reduces worst-
case blocking for readers and an efficient local-spin imple-
mentation is provided. Both task- and phase-fair locks are
evaluated and contrasted to mutex locks in terms of hard and
soft real-time schedulability under consideration of runtime
overheads on a multicore computer.
1 Introduction
With the transition to multicore architectures by most (if not
all) major chip manufacturers, multiprocessors are now a stan-
dard deployment platform for (soft) real-time applications.
This has led to renewed interest in real-time multiprocessor
scheduling and synchronization algorithms (see [11, 14, 15,

  

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

 

Collections: Computer Technologies and Information Sciences