Distributed acyclic orientation of asynchronous anonymous networks

  • Antonio Calabrese
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1279)


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.

Unable to display preview. Download preview PDF.


  1. [1]
    Barbosa V.C., Gafni E. (1989). Concurrency in heavily loaded neighborhood-constrained systems. ACM Trans. on Prog. Lang. and Systems 11(4), 562–584.CrossRefGoogle Scholar
  2. [2]
    Chandy K.M., Misra J. (1984). The drinking philosophers problem. ACM Trans. on Prog. Lang. and Systems 6(4), 632–646.CrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    Attiya H., Shachnai H., Tamir T. (1994). Local Labeling and Resource Allocation Using Preprocessing. WDAG'94 LNCS 857, 194–208.Google Scholar
  5. [5]
    Barbosa V.C. (1993). Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimization. Ellis Horwood.Google Scholar
  6. [6]
    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
  7. [7]
    Angluin D. (1980). Local and global properties in networks of processors. Proceedings of 12th ACM Symposium on Theory of Computing. Los Angeles.Google Scholar
  8. [8]
    Yamashita M, Kameda T. (1996). Computing on Anonymous Networks: Part I. IEEE Trans. on Par. and Distributed Systems, 20(1), 69–89.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Antonio Calabrese
    • 1
  1. 1.Istituto di Cibernetica CNRArco FeliceItaly

Personalised recommendations