Distributed computing on anonymous hypercubes with faulty components

Extended abstract
  • Evangelos Kranakis
  • Nicola Santoro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 647)


We give efficient algorithms for distributed computation on anonymous, labeled, asynchronous hypercubes with possible faulty components (i.e. processors and links). The processors are deterministic and execute identical protocols given identical data. Initially, they know only the size of the network (in this instance, a power of 2) and that they are inter-connected in a hypercube network. Faults may occur only before the start of the computation (and that despite this the hypercube remains a connected network). However the processors do not know where these faults are located. As a measure of complexity we use the total number of bits transmitted during the execution of the algorithm and we concentrate on giving algorithms that will minimize this number of bits. The main result of this paper is an algorithm for computing boolean functions on anonymous hypercubes with at most γ faulty components, γ≥1, with bit complexity O(Nδ n (γ)2λ2 log log N), where γ is the number of faulty components, of which λ is the number of faulty links, and δ n (γ) is the diameter of the hypercube.

1980 Mathematics Subject Classification


CR Categories


Key words and Phrases

Anonymous labeled hypercube boolean function diameter faulty component group of automorphisms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Aiello and T. Leighton, “Coding Theory, Hypercube Embedding and Fault Tolerance”, Proceedings of 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, 125–136.Google Scholar
  2. 2.
    D. Angluin, “Local and Global Properties in Networks of Processors”, 12th Annual ACM Symposium on Theory of Computing, 1980, 82–93.Google Scholar
  3. 3.
    H. Attiya and M. Snir and M. Warmuth, “Computing on an Anonymous Ring”, Journal of the ACM, 35 (4), 1988. Short version has appeared in proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computation, 1985, 845–875.Google Scholar
  4. 4.
    P. W. Beame and H. L. Bodlaender, “Distributed Computing on Transitive Networks: The Torus”, 6th Annual Symposium on Theoretical Aspects of Computer Science, STACS, 1989, B. Monien and R. Cori, editors, Springer Verlag Lecture Notes in Computer Science. 294–303.Google Scholar
  5. 5.
    B. Becker and H.-U. Simon, “How Robust is the n-Cube?”, Proceedings of IEEE 27th Annual Symposium on Foundations of Computer Science, 1986, 283–291.Google Scholar
  6. 6.
    M-S. Chen and K. G. Shin, “Adaptive Fault-Tolerant Routing in Hypercube Multicomputers”, IEEE Transactions on Computers, 39 (12), December 1990, 1406–1416.Google Scholar
  7. 7.
    J. Hastad and T. Leighton and M. Newmann, “Reconfiguring a Hypercube in the Presence of Faults”, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, 274–284.Google Scholar
  8. 8.
    E. Kranakis and D. Krizanc, “Distributed Computing on Anonymous Hypercube Networks”, Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, Dallas, Dec. 2–5, 1991, 722–729.Google Scholar
  9. 9.
    H. Wielandt, “Finite Permutation Groups”, Academic Press, 1964.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Evangelos Kranakis
    • 1
  • Nicola Santoro
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations