Fast, long-lived renaming
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In this paper, we present several new renaming algorithms. Most of our algorithms have time complexity that is independent of the size of the original name space, and some of our algorithms solve a new, more general version of the renaming problem called long-lived renaming. In long-lived renaming algorithms, processes may repeatedly acquire and release names.
Unable to display preview. Download preview PDF.
- 1.J. Anderson and M. Moir, “Using k-Exclusion to Implement Resilient, Scalable Shared Objects”, to appear in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing.Google Scholar
- 2.H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk, “Achievable Cases in an Asynchronous Environment”, Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, October 1987, pp. 337–346.Google Scholar
- 3.A. Bar-Noy and D. Dolev, “Shared Memory versus Message-Passing in an Asynchronous Distributed Environment”, Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, August 1989, pp. 307–318.Google Scholar
- 4.BBN Advanced Computers, Inside the TC2000 Computer, February, 1990.Google Scholar
- 5.E. Borowsky and E. Gafni, “Immediate Atomic Snapshots and Fast Renaming”, Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, August 1993, pp. 41–50.Google Scholar
- 6.M. Herlihy and N. Shavit, “The Asynchronous Computability Theorem for t-Resilient Tasks”, Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 111–120.Google Scholar