Abstract
We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all identical, nor necessarily unique; processors receive inputs and must reach outputs that respect a relation. We focus on the partially eponymous ringR, and we are interested in the computation of circularly symmetric relations on it.
∙ We distinguish between solvability and computability: in solvability, processors must always reach outputs that respect the relation; in computability, they must reach outputs that respect the relation whenever possible, and report impossibility otherwise.
– We provide an efficient characterization of solvability of an arbitrary (circularly symmetric) relation on an arbitrary set of rings. The characterization is topological and can be expressed as a number-theoretic property that can be checked efficiently.
– We present a universal distributed algorithm for computing any arbitrary (circularly symmetric) relation on any set of rings.
∙ Towards obtaining message complexity bounds, we derive a distributed algorithm for a natural generalization of Leader Election, in which a (non-zero) number of leaders are elected. We use this algorithm as a subroutine of our universal algorithm for collecting views; hence, we prove, as our main result, an upper bound on the message complexity of this particular instantiation of our universal algorithm to compute an arbitrary (circularly symmetric) relation on an arbitrary set of rings. The shown upper bound demonstrates a graceful degradation with the Least Minimum Base, a parameter indicating the degree of topological compatibility between the relation and the set of rings. We employ this universal upper bound to identify two interesting cases where an arbitrary relation can be computed with an efficient number of \(O(|R| \cdot \lg |R|)\) messages: The set of rings is universal (which allows the solvability of Leader Election), or logarithmic (where each identity appears at most \(\lg |R|\) times).
This work has been partially supported by the IST Program of the European Union under contract number IST-15964 (AEOLUS).
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
Angluin, D.: Local and Global Properties in Networks of Processors. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp. 82–93 (1980)
Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM 35(4), 845–875 (1988)
Boldi, P., Vigna, S.: An Effective Characterization of Computability in Anonymous Networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33–47. Springer, Heidelberg (2001)
Boldi, P., Vigna, S.: Fibrations of Graphs. Discrete Mathematics 243, 21–66 (2002)
J. E. Burns.: A Formal Model for Message Passing Systems,” Technical Report TR-91, Department of Computer Science, Indiana University (1980)
Chalopin, J., Das, S., Santoro, N.: Groupings and Pairings in Anonymous Networks. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 105–119. Springer, Heidelberg (2006)
Dobrev, S., Pelc, A.: Leader Election in Rings with Nonunique Labels. Fundamenta Informaticae 59(4), 333–347 (2004)
Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N.: Sorting and Election in Anonymous Asynchronous Rings. Journal of Parallel and Distributed Computing 64(2), 254–265 (2004)
Hirschberg, D., Sinclair, J.B.: Decentralized Extrema-Finding in Circular Configurations of Processes. Communications of the ACM 23(11), 627–628 (1980)
Leighton, F.T.: Finite Common Coverings of Graphs. Journal of Combinatorial Theory (Series B) 33, 231–238 (1982)
LeLann, G.: Distributed Systems - Towards a Formal Approach. In: Information Processing 77, Proceedings of the IFIP Congress, pp. 155–160 (1977)
Yamashita, M., Kameda, T.: Computing on Anonymous Networks, Part I: Characterizing the Solvable Cases. IEEE Transactions on Parallel and Distributed Systems 7(1), 69–89 (1996)
Yamashita, M., Kameda, T.: Computing on Anonymous Networks, Part II: Decision and Membership Problems. IEEE Transactions on Parallel and Distributed Systems 7(1), 90–96 (1996)
Yamashita, M., Kameda, T.: Computing Functions on Asynchronous Anonymous Networks. Mathematical Systems Theory 29(4), 331–356 (1998)
Yamashita, M., Kameda, T.: Leader Election Problem on Networks in Which Processor Identity Numbers are not Distinct. IEEE Transactions on Parallel and Distributed Systems 10(9), 878–887 (1999)
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
Mavronicolas, M., Michael, L., Spirakis, P. (2006). Computing on a Partially Eponymous Ring. 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_27
Download citation
DOI: https://doi.org/10.1007/11945529_27
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)