Distributed acyclic orientation of asynchronous anonymous networks
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).
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- Attiya H., Shachnai H., Tamir T. (1994). Local Labeling and Resource Allocation Using Preprocessing. WDAG'94 LNCS 857, 194–208.Google Scholar
- Barbosa V.C. (1993). Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimization. Ellis Horwood.Google Scholar
- 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.Google Scholar
- Angluin D. (1980). Local and global properties in networks of processors. Proceedings of 12th ACM Symposium on Theory of Computing. Los Angeles.Google Scholar