Advertisement

Computations in undistinguished networks

  • Shaji Bhaskar
  • Gael N. Buckley
Session 3 Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)

Abstract

The correctness of most distributed algorithms depends on the existence of a unique name for each computer in the network. Several authors have investigated the consequences of the absence of such names on the sort of computations that can be performed on a network. It has been shown that it is not always possible to perform even relatively simple distributed computations such as determining the network topology or electing a leader if the number of nodes in the network is not known.

We make an additional assumption: that the number of nodes in the network is known to each node. We demonstrate distributed decision procedures to determine whether it is possible to compute network topology or carry out elections. The decision procedures can be modified into algorithms to determine topology and elect unique leaders in those topologies where it is possible to do so.

Keywords

Deterministic Algorithm Unique Leader Port Number Network Program Input Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.Local and Global Properties in Networks of Processors. Proceedings of the 12th. Annual ACM Symposium on the Theory of Computing, (April 1980), pp 82–93.Google Scholar
  2. 2.
    Attiya, C., Snir, M., and Warmouth, M.Computing on an Anonymous Ring. Proceedings of the 4rth Annual ACM Symposium on Principles of Distributed Computing, (August 1985), pp 196–203.Google Scholar
  3. 3.
    Chang, E. and Roberts, R.An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors. Comm. ACM 22 5, (May 1979), pp. 281–283.CrossRefGoogle Scholar
  4. 4.
    Garcia-Molina, H.Elections in a Distributed Computing System. IEEE Transactions on Computers, C-31 1, (January 1982), pp 48–59.Google Scholar
  5. 5.
    Hirschberg, D.S., and Sinclair, J.B.Decentralized Extrema-Finding in Circular Configurations of Processors. Comm. ACM 23 11, (Nov. 1980), pp. 627–628.CrossRefGoogle Scholar
  6. 6.
    Itai, A., and Rodeh, M.Symmetry Breaking in Distributive Networks. Proceeding of the 22nd Symposium on the Foundations of Computer Science, IEEE, (October 1981), pp 150–158.Google Scholar
  7. 7.
    Kohavi., Z. Switching and Finite Automata Theory. McGraw-Hill, 1970Google Scholar
  8. 8.
    Lelann, G.Distributed Systems — Towards a Formal Approach. Information Processing vol. 77, Elsevier Science, New York, pp. 155–160.Google Scholar
  9. 9.
    Peterson, G.L.An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Transactions On Programming Languages and Systems, 4 4, (Oct. 1982), pp. 758–762.CrossRefGoogle Scholar
  10. 10.
    Pachl, J., Korach, E., and Rotem, D.Lower Bounds For Distributed Election Algorithms in Circular Configurations of Processors. Research Report CS-81-33, Department of Computer Science, University of Waterloo, (Nov. 1981).Google Scholar
  11. 11.
    Rogers, H.The Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Shaji Bhaskar
    • 1
  • Gael N. Buckley
    • 2
  1. 1.Department of Computer ScienceState University of New YorkStony Brook
  2. 2.Department of Computer ScienceUniversity of TexasAustin

Personalised recommendations