Summary: Fast, waitfree (2k \Gamma 1)Renaming
Yehuda Afek \Lambda Michael Merritt y
We describe a fast, waitfree (2k \Gamma 1)renaming algo
rithm which takes O(k 2 ) time. (Where k is the con
tention, the number of processes actually taking steps in
a given run.) The algorithm makes extensive use of tools
and techniques developed by Attiya and Fouren [AF98].
Other extensions, including a fast (longlived) atomic
snapshot algorithm, are briefly discussed.
Since early work in mutual exclusion [Lam87], re
searchers have asked whether distributed algorithms can
be made fast; that is, can their worstcase time complex
ity be bounded by a function of the number of actually
active or contending processes, rather than the total
number of processes that might take steps [ADT95] 1 ?
If a fast solution can be found for a given problem, is
there a tradeoff in other measures?