Spin-based reader-writer synchronization for multiprocessor real-time systems

  • Authors:
  • Björn B. Brandenburg;James H. Anderson

  • Affiliations:
  • Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA 27599-3175;Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA 27599-3175

  • Venue:
  • Real-Time Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 consideration of runtime overheads on a multicore Sun "Niagara" UltraSPARC T1 processor. Formal bounds on worst-case blocking are derived for all considered lock types.