Polynominal and Adaptive Long-Lived (2k-1)-Renaming

@inproceedings{Attiya2000PolynominalAA,
  title={Polynominal and Adaptive Long-Lived (2k-1)-Renaming},
  author={Hagit Attiya and Arie Fouren},
  booktitle={DISC},
  year={2000}
}
In the long-lived M-renaming problem, processes repeatedly obtain and release new names taken from a domain of size M. This paper presents the rst polynomial algorithm for long-lived (2k ? 1)-renaming. The algorithm is adaptive as its step complexity is O(k 4); here k is the point contention|the maximal number of simultaneously active processes in some point of the execution. Polynomial step complexity is achieved by having processes help each other to obtain new names, while adaptiveness is… CONTINUE READING