Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Time Bounds for Mutual Exclusion and Related Problems (Extended Abstract)
 

Summary: Time Bounds for Mutual Exclusion and Related Problems
(Extended Abstract)
Jae-Heon Yang
Department of Computer Science
The University of Maryland
College Park, Maryland 20742-3255
James H. Anderson
Department of Computer Science
The University of North Carolina
Chapel Hill, North Carolina 27599-3175
Abstract
We establish trade-o s between time complexity and
write- and access-contention for solutions to the mu-
tual exclusion problem. The write-contention (access-
contention) of a concurrent program is the number
of processes that may be simultaneously enabled to
write (access) the same shared variable. Our notion
of time complexity distinguishes between local and re-
mote references to shared memory. We show that,
for any N-process mutual exclusion algorithm with

  

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

 

Collections: Computer Technologies and Information Sciences