Long lived adaptive splitter and applications.

Yehuda Afek, Gideon Stupp, Dan Touitou

Research output: Contribution to journalArticlepeer-review


Long-lived and adaptive implementations of mutual exclusion and renaming in the read/write shared memory model are presented. An implementation of a task is adaptive if the step complexity of any operation in the implementation is a function of the number of processes that take steps concurrently with the operation. The renaming algorithm assigns a new unique id in the range 1, ···, 4k2 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 processes that actually take steps or hold a name while the new name is being acquired. The step complexity of acquiring a new name is O(k2), while the step complexity of releasing a name is 1. The space complexity of the algorithm is O(Nn2) where n is an upper bound on the number of processes that may be active at the same time (acquiring or holding new names), which could be N in the worst case. Both the system response time and the worst case number of operations per process in the presented mutual-exclusion algorithm are adaptive. Both algorithms rely on the basic building block of a long-lived and adaptive splitter. While the adaptive-splitter satisfies a slightly different set of properties than the Moir-Anderson splitter [MA95], it is adaptive and long-lived. In addition, the new splitter properties enable the construction of a non-blocking long-lived (2k - 1)-renaming algorithm (which is optimal in the size of the new name space). We believe that the mechanisms introduced in our splitter implementation are interesting on their own, and might be used in other adaptive and long-lived constructions.

Original languageUndefined/Unknown
Pages (from-to)67-86
Number of pages20
JournalDistributed Comput.
Issue number2
StatePublished - 2002


  • Adaptive algorithms
  • Contention
  • Long-lived
  • Mutual exclusion
  • Read/write shared memory
  • Renaming
  • Wait-free

Cite this