Summary: Long­Lived Renaming Made Adaptive
(Extended Abstract)
Yehuda Afek \Lambda Hagit Attiya y Arie Fouren z Gideon Stupp x Dan Touitou --
Abstract
Two implementations of an adaptive, wait­free, and
long­lived renaming task in the read/write shared mem­
ory model are presented. Implementations of long­
lived and adaptive objects were previously known only
in the much stronger model of load­linked and store­
conditional (i.e., read­modify­write) shared memory. In
read/write shared­memory only one­shot adaptive ob­
jects are known. Presented here are two algorithms
that assign a new unique id in the range 1; \Delta \Delta \Delta ; O(k 2 )
to any process whose initial unique name is taken from
a set of size N , for an arbitrary N and where k is the
number of processors that actually take steps or hold
a name while the new name is being acquired. The
step complexity of acquiring a new name is respectively
O(k 2 ) and O(k 2 log k), while the step complexity of re­
leasing a name is 1. The main differences between the

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

Collections: Computer Technologies and Information Sciences