Abstract
We present new distributed randomized naming protocols improving previous results in renaming and unique processor identity protocols. They are waitfree (which implies maximal fault-tolerance) and/or allow stronger adversaries. They also have low complexity. We give the first wait-free protocol achieving optimal key space range. (This is impossible for deterministic wait-free methods, so we use randomization.) We also introduce a novel wait-free object, a test-and-set object which upon invocation succeeds with probability less than 1, and we give a low complexity implementation of such objects.
Partially supported by NWO through NFI Project ALADDIN under Contract Nr. NF 62-376; the first author was supported by an ERCIM Fellowship; the second author was also partially supported by a NUFFIC Fellowship; the second and third author were also partially supported by the European Union ESPRIT Project ALCOM (Nr. 7141); the fourth author was also partially supported by the European Union through NeuroCOLT ESPRIT Working Group Nr. 8556.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Afek, Y., H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit Atomic Snapshots of shared memory. Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC), 1990, pp. 1–14.
Anderson, J. Composite registers. Proc. 9th ACM PODC Symposium, 1990, pp. 15–30. (Also in Distributed Computing).
Attiya, H., Bar-noy, A., Dolev, D., Peleg, D., and Reischuk, R. Renaming in an Asynchronous Environment. J. ACM 37, 3 (July 1990), 524–548.
Afek, Y., Gafni, E., Tromp, J., and Vitanyi, P.M.B. Wait-free test-and-set In Proceedings of the 6th International Workshop on Distributed Algorithms, volume 647 of LNCS, Springer-Verlag 1992, pp. 85–94.
Bar-Noy, A., and Dolev. D. Shared Memory vs. Message-passing in an Asynchronous Distributed Environment. In Proceedings of the 12th ACM PODC Symposium, 1993, pp. 41–52.
Borowsky. E., and Gafni. E. Immediate Atomic Snapshots and Fast Renaming. In Proceedings of the 8th ACM PODC Symposium, 1989, pp. 307–318.
W. Feller An Introduction to Probability Theory and Its Applications, vol 1. 1968.
Fisher, M.J., Lynch, N.A., and Paterson, M.S. Impossibility of Distributed Consensus with One Faulty Processor. J. ACM 32, 2 (Apr. 1985), 374–382.
Herlihy, M. Wait-free synchronization. ACM TOPLAS 13, 1 (Jan. 1991), pp. 124–149.
Herlihy, M., and Shavit, N. The Asynchronous Computability Theorem for t-Resilient Tasks. In Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 111–120.
Tanenbaum, A. Computer Networks. Prentice-Hall, 1981.
Kutten S., Ostrovsky R. and Patt-Shamir B. The Las-Vegas Processor Identity Problem. In Proceedings of the 2nd Israel Symposium on Theory of Computing and Systems, 1993.
L. Lamport. On Interprocess Communication. Distributed Computing 1, 1, 1986, pp. 86–101.
Loui, M.C., and Abu-Amara, H.H. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Advances in Comp. Research, vol. 4, JAI Press, 1987, pp. 163–183.
Rabin, M.O. The Choice Coordination Problem. Acta Informatica 17, (1982), 121–134.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panconesi, A., Papatriantafilou, M., Tsigas, P., Vitányi, P. (1994). Randomized wait-free naming. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_169
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_169
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive