Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Adaptive and Efficient Mutual Exclusion \Lambda [Extended Abstract]
 

Summary: Adaptive and Efficient Mutual Exclusion \Lambda
[Extended Abstract]
Hagit Attiya and Vita Bortnikov
Department of Computer Science
The Technion
Haifa 32000, Israel
hagit@cs.technion.ac.il
vitab@cs.technion.ac.il
ABSTRACT
A distributed algorithm is adaptive if its performance de­
pends on k, the number of processes that are concurrently
active during the algorithm execution (rather than on n, the
total number of processes). This paper presents adaptive
algorithm for mutual exclusion using only read and write
operations.
The worst case step complexity cannot be a measure for the
performance of mutual exclusion algorithms, because it is
always unbounded in the presence of contention. Therefore,
a number of different parameters are used to measure the
algorithm's performance: The remote step complexity is the

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences