Skip to main content
SpringerLink
Log in

Distributed acyclic orientation of asynchronous anonymous networks

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Included in the following conference series:

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  Google Scholar 

  2. Chandy K.M., Misra J. (1984). The drinking philosophers problem. ACM Trans. on Prog. Lang. and Systems 6(4), 632–646.

    Article  Google Scholar 

  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. Attiya H., Shachnai H., Tamir T. (1994). Local Labeling and Resource Allocation Using Preprocessing. WDAG'94 LNCS 857, 194–208.

    Google Scholar 

  5. Barbosa V.C. (1993). Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimization. Ellis Horwood.

    Google Scholar 

  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. 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. Yamashita M, Kameda T. (1996). Computing on Anonymous Networks: Part I. IEEE Trans. on Par. and Distributed Systems, 20(1), 69–89.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Cibernetica CNR, I-80072, Arco Felice, Italy

    Antonio Calabrese

Authors
  1. Antonio Calabrese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation