Abstract
Recent advances in Network Attached Storage (NAS) devices has given rise to research on tasks in which the number of potentially participating processors is not known or even bounded in advance. In many of such situations the output of processors depends upon the group the processor belongs to, rather than upon the individual.
Case in point: the renaming task in which processors dynamically acquire unique individual slots. In the group version of the renaming task, processors from the same group are allowed to share a slot. Sharing slots by processors for the same group may be applicable when processors are to post information and processors of the same group possess the same information. The difficulty in reducing the group version to the individual version arises from the fact that in an asynchronous READ-WRITE wait-free model of computation, a group cannot elect a leader to acquire slot on the group’s behalf and post the information.
This paper generalizes the notion of a standard task solvability to solvability by groups. It is mainly concerned with solvability by groups of infinite size. It shows that the notion of group solvability by infinite size groups is proper restriction of standard solvability by proving that the Immediate Snapshots task on three processors is not group solvable. The paper’s main technical contribution is in reducing a question about infinite size groups to finite size. It characterizes group solvability of a task T n over n+1 processors via solvability by groups of size n. Finally, it poses a challenging lower-bound conjecture on a proposed group-solvable version of the renaming task.
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
Attiya, H., Bar-Noy, A., Dolev, D., Roller, D., Peleg, D., Reischuk, R.: Achievable Cases in an Asynchronous Environment. In: Proceedings of the 28th Symposium on Foundations of Computer Science, pp. 337–346 (1987)
Joung, Y.: Asynchronous group mutual-exclusion. Distributed Computing 13, 189–206 (2000)
Hadzilacos, V.: A note on group mutual-exclusion. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, pp. 100–106 (2001)
Merritt, M., Taubenfeld, G.: Computing with infinitly many processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)
Gafni, E.: A simple algorithmic characterization of uniform solvability. In: Proceedings of the 4rd Annual IEEE Symposium On Foundation of Computer Science (FOCS 2002), pp. 228–237 (2002)
Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proceedings of the 21th ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 78–87 (2002)
Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp. 41–51 (1993)
Herlihy, M., Shavit, N.: The topological structure of asynchronous computabil-ity. Journal of the ACM 46(6), 858–923 (1999)
Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computations. In: PODC 1997, pp. 189–198 (1997)
Bar-Noy, A., Dolev, D.: Shared-memory vs. message-passing in an asynchronous distributed environment. In: PODC 1989, pp. 307–318 (1989)
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. In: Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pp. 1–13 (1990)
Frederickson, G., Lynch, N.: Electing a Leader in a Synchronous Ring. Journal of the ACM 34(1), 98–115 (1987)
Borowsky, E., Gafni, E.: Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. In: Proceedings of the 25th ACM Symposium on the Theory of Computing, pp. 91–100 (1993)
Saks, M., Zaharoglou, F.: Wait-Free A;-Set Agreement is Impossible: The Topology of Public Knowledge. In: Proceedings of the 26th ACM Symposium on the Theory of Computing, pp. 101–110 (1993)
Spanier, E.H.: Algebraic Topology. Springer, New York (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gafni, E. (2004). Group-Solvability. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30186-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23306-0
Online ISBN: 978-3-540-30186-8
eBook Packages: Springer Book Archive