Summary: Distributed Computing manuscript No.
(will be inserted by the editor)
An Adaptive Collect Algorithm with Applications
Hagit Attiya ?1 , Arie Fouren 1 , Eli Gafni 2
1 Department of Computer Science, The Technion, Haifa 32000, Israel. hagit@cs.technion.ac.il,leonf@cs.technion.ac.il.
2 Computer Science Department, UCLA. eli@cs.ucla.edu.
The date of receipt and acceptance will be inserted by the editor
Summary. In a shared­memory distributed system, n
independent asynchronous processes communicate by read­
ing and writing to shared variables. An algorithm is
adaptive (to total contention) if its step complexity de­
pends only on the actual number, k, of active processes
in the execution; this number is unknown in advance
and may change in different executions of the algorithm.
Adaptive algorithms are inherently wait­free, providing
fault­tolerance in the presence of an arbitrary number of
crash failures and different processes' speed.
A wait­free adaptive collect algorithm with O(k) step
complexity is presented, together with its applications
in wait­free adaptive algorithms for atomic snapshots,

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

Collections: Computer Technologies and Information Sciences