Abstract
A very simple randomised distributed algorithm imposing an acyclic orientation on any arbitrary anonymous asynchronous network is presented in this paper. The problem is faced under the noinfo assumption: no network attribute is available and when the algorithm starts each processor only knows the number of its input/output ports (i.e. the number of its immediate neighbours). The presented algorithm terminates explicitly (process termination) in O(logn)-time on a non complete graph only exchanging messages of constant size among immediate neighbours (i.e. nodes connected through a direct link).
Preview
Unable to display preview. Download preview PDF.
References
Barbosa V.C., Gafni E. (1989). Concurrency in heavily loaded neighborhood-constrained systems. ACM Trans. on Prog. Lang. and Systems 11(4), 562–584.
Chandy K.M., Misra J. (1984). The drinking philosophers problem. ACM Trans. on Prog. Lang. and Systems 6(4), 632–646.
Gafni E. M., Bertsekas D. P. (1981). Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. Commusource Allocationn. COM-29, 1, 11–18.
Attiya H., Shachnai H., Tamir T. (1994). Local Labeling and Resource Allocation Using Preprocessing. WDAG'94 LNCS 857, 194–208.
Barbosa V.C. (1993). Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimization. Ellis Horwood.
Barbosa V.C., Lima P.M.V. (1990). On the distributed parallel simulation of Hopfield's neural networks. Software, Practice and Experience, 20(10), 967–983.
Angluin D. (1980). Local and global properties in networks of processors. Proceedings of 12th ACM Symposium on Theory of Computing. Los Angeles.
Yamashita M, Kameda T. (1996). Computing on Anonymous Networks: Part I. IEEE Trans. on Par. and Distributed Systems, 20(1), 69–89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calabrese, A. (1997). Distributed acyclic orientation of asynchronous anonymous networks. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036177
Download citation
DOI: https://doi.org/10.1007/BFb0036177
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63386-0
Online ISBN: 978-3-540-69529-5
eBook Packages: Springer Book Archive