Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Shared-memory Mutual Exclusion: Major Research Trends Since 1986
 

Summary: Shared-memory Mutual Exclusion: Major Research
Trends Since 1986
James H. Anderson and Yong-Jik Kim
Department of Computer Science
University of North Carolina at Chapel Hill
Ted Herman
Department of Computer Science
University of Iowa
June 2001, Revised May 2002, September 2002, and January 2003
Abstract
In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [70]. In
this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion.
Keywords: Adaptive mutual exclusion, fast mutual exclusion, group mutual exclusion, k-exclusion, local
spinning, nonatomic algorithms, shared-memory systems, time complexity, timing-based algorithms
1 Introduction
Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent pro-
cesses. The problem of designing such an algorithm is widely regarded as one of the "classic" problems in
concurrent programming. In the mutual exclusion problem, a process accesses the resource to be managed
by executing a "critical section" of code. Activities not involving the resource occur within a corresponding
"noncritical section." Before and after executing its critical section, a process executes two other code frag-

  

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

 

Collections: Computer Technologies and Information Sciences