Abstract
Recently Mostefaoui, Raynal, and Travers [1] showed that with the use of k-set-consensus they can strongly rename n processors into the range of 2n–⌈n/k ⌉. That is the overhead is n–⌈n/k ⌉. Here we reduce the range to n+k–1, i.e. we reduce the overhead to k–1. For k=c the improvement in the overhead is O(n). We first argue that such an algorithm using topological embedding does exist. We then come-up with a novel explicit algorithm that does not require explicit embedding. The latter technique employed is of independent importance and interest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mostéfaoui, A., Raynal, M., Travers, C.: Exploring Gafni’s Reduction Land: From Ωk to Wait-Free Adaptive \((2p-\lceil\frac{p}{k}\rceil)\)-Renaming Via k-Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 1–15. Springer, Heidelberg (2006)
Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524–548 (1990)
Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41–51. ACM Press, New York (1993)
Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distributed Computing 14(3), 127–146 (2001)
Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)
Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing. PODC 1998, Puerto Vallarta, Mexico, June 28 - July 02, 1998, pp. 143–152. ACM Press, New York (1998)
Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499–516 (1986)
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. In: Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 1–13. ACM Press, New York (1990)
Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91–100. ACM Press, New York (1993)
Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189–198. ACM Press, New York (1997)
Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing 14(3), 127–146 (2001)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105, 132–158 (1993)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)
Gafni, E.: Group-solvability. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 30–40. Springer, Heidelberg (2004), http://www.cs.ucla.edu/~eli/eli/godel.ppt
Gafni, E.: Group-solvability. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 30–40. Springer, Heidelberg (2004)
Gafni, E., Kouznetsov, P.: Two Front Agreement with Application to Emulation and Robustness (to appear)
Gafni, E., Merritt, M., Taubenfeld, G.: The Concurrency Hierarchy, and Algorithms for Unbounded Concurrency. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 161–169. ACM Press, New York (2001)
Gafni, E., Rajsbaum, S.: Musical Benches. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 63–77. Springer, Heidelberg (2005)
Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The Committee Decision Problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 502–514. Springer, Heidelberg (2006)
Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on programming Languages and Systems 11(1), 124–149 (1991)
Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)
Mostefaoui, A., Raynal, M., Tronel, F.: From Binary Consensus to Multivalued Consensus in Asynchronous Message-Passing Systems. Information Processing Letters 73, 207–213 (2000)
Merrit, M., Taubenfeld, G.: Computing with infinitely many processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)
Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing 29(5), 1449–1483 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gafni, E. (2006). Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots. In: Shvartsman, M.M.A.A. (eds) Principles of Distributed Systems. OPODIS 2006. Lecture Notes in Computer Science, vol 4305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945529_4
Download citation
DOI: https://doi.org/10.1007/11945529_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49990-9
Online ISBN: 978-3-540-49991-6
eBook Packages: Computer ScienceComputer Science (R0)