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. email@example.com,firstname.lastname@example.org.
2 Computer Science Department, UCLA. email@example.com.
The date of receipt and acceptance will be inserted by the editor
Summary. In a sharedmemory 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 waitfree, providing
faulttolerance in the presence of an arbitrary number of
crash failures and different processes' speed.
A waitfree adaptive collect algorithm with O(k) step
complexity is presented, together with its applications
in waitfree adaptive algorithms for atomic snapshots,