Skip to main content
SpringerLink
Log in

Deterministic message routing in faulty hypercubes

  • Multiprocessor Systems And Concurrency
  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1990)

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

Included in the following conference series:

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. J. Hastad, F. T. Leighton and M. Newman, "Fast Computation Using Faulty Hypercubes", proceedings of the ACM Symposium on Theory of Computing '89, pp 251–263.

    Google Scholar 

  2. P. Raghavan, "Robust Algorithms for Packet Routing in a Mesh", proceedings of the ACM Symposium on Parallel Algorithms and Architectures '89, pp 344–350.

    Google Scholar 

  3. Y. Saad and M. Schultz, "Topological Properties of Hypercubes", TR: YALEU/DCS/RR-389, IEEE Transactions on Computers, Vol. 37, No. 7, July 1988, pp 867–872.

    Google Scholar 

  4. S. Madhavapeddy and I. Hal Sudborough, "Disjoint Paths in the Hypercube", Springer Verlag's Lecture notes in Computer Science, Vol. 411, pp 3–18, special edition for the proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science.

    Google Scholar 

  5. S. Madhavapeddy and I. Hal Sudborough, "A Topological Property of Hypercubes: Node Disjoint Paths", TR: UTDCS-30-89, to appear in the proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing.

    Google Scholar 

  6. L. G. Valiant and G. J. Brebner, "Universal Schemes for Parallel Communication", proceedings of the ACM Symposium on Theory of Computing '81, pp 263–277.

    Google Scholar 

  7. S. Madhavapeddy, "A Decision Algorithm for Finding Node Disjoint Paths in the Hypercube", manuscript, Computer Science Program, University of Texas at Dallas.

    Google Scholar 

  8. D. Dolev, J. Halpern, B. Simons and R. Strong, "A New Look at Fault Tolerant Network Routing", proceedings of the ACM Symposium on Theory of Computing '84, pp 526–535.

    Google Scholar 

  9. M. Chen and K. Shin, "Message Routing in an Injured Hypercube", proceedings of the 3rd Conference on Hypercubes, Concurrent Computers and Applications '88.

    Google Scholar 

  10. F. T. Leighton, B. Maggs and S. Rao, "Universal Packet Routing Algorithms", proceedings of the IEEE Symposium on Foundations of Computer Science '88, pp 256–269.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Program, University of Texas at Dallas, 75083-0688, Richardson, Texas

    Seshu Madhavapeddy & I. Hal Sudborough

Authors
  1. Seshu Madhavapeddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Hal Sudborough
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madhavapeddy, S., Sudborough, I.H. (1991). Deterministic message routing in faulty hypercubes. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-53832-1_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53832-5

  • Online ISBN: 978-3-540-46310-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation