Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Space-and Time-ecient Local-spin Spin Lock Yong-Jik Kim and James H. Anderson
 

Summary: A Space- and Time-e∆cient Local-spin Spin Lock
Yong-Jik Kim and James H. Anderson
Department of Computer Science
University of North Carolina at Chapel Hill
March 2001
Abstract
A simple code transformation is presented that reduces the space complexity of Yang and Anderson's
local-spin mutual exclusion algorithm. In this algorithm, only atomic read and write instructions are
used; each process generates (log N) remote memory references per lock request, where N is the number
of processes. The space complexity of the transformed algorithm is (N ), which is clearly optimal. Its
time complexity is (log N ), like the original.
Keywords: Mutual exclusion, local spinning, read/write atomicity, shared-memory systems, space com-
plexity
1 Introduction
In the mutual exclusion problem [4], each of a set of N processes repeatedly executes a \critical section" of
code. Each process's critical section is preceded by an \entry section" and followed by an \exit section."
The objective is to design the entry and exit sections so that the following requirement holds.
 Exclusion: At most one process executes its critical section at any time.
In the variant of the problem considered here, we also require the following.
 Starvation-freedom: Each process in its entry section eventually enters its critical section.

  

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

 

Collections: Computer Technologies and Information Sciences