Skip to main content
SpringerLink
Log in

Reliable communication on cube-based multicomputers

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We consider a distributed unicasting algorithm for hypercubes with faulty nodes (including disconnected hypercubes) using the safety level concept. The safety level of each node in ann-dimensional hypercube is an approximated measure of the number and distribution of faulty nodes in the neighborhood and it can be easily calculated throughn−1 rounds of information exchange among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the safety level of the source node is no less than the Hamming distance between the source and the destination. The feasibility of an optimal or suboptimal unicasting can be easily determined at the source node by comparing its safety level, together with its neighbors’ safety levels, with the Hamming distance between the source and the destination. The proposed scheme is also the first attempt to address the unicasting problem in disconnected hypercubes. The safety level concept is also extended to be used in hypercubes with both faulty nodes and links and in generalized hypercubes.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bhuyan L N, Agrawal D P. Generalized hypercube and hyperbus structures for a computer network.IEEE Trans. on Computers, 1984, 32(4): 323–333.

    Article  Google Scholar 

  2. Chen M S, Shin K G. Adaptive fault-tolerant routing in hypercube multicomputers.IEEE Trans. on Computers, 1990, 39(12): 1406–1416.

    Article  MathSciNet  Google Scholar 

  3. Chiu G M, Chalasani S, Raghavendra C S. Flexible, fault-tolerant routing criteria for circuit switched hypercubes. InProc. of the 11th Int’l Conf. on Distributed Computing Systems, May 1991, pp. 582–589.

  4. Chiu G M, Wu S P. Fault-tolerant routing strategy in hypercube multicomputers. InProc. of the 24th Int’l Symp. on Fault-Tolerant Computing, June 1994.

  5. Dally W J, Seitz C L. Deadlock-free message routing in multiprocessor interconnection networks.IEEE trans. on Computers, 1987, 36(5): 547–553.

    Article  MATH  Google Scholar 

  6. Gaughan P T, Yalamanchili S. Adaptive routing protocols for hypercube interconnection networks.Computer, 1993, 26(5): 12–24.

    Article  Google Scholar 

  7. Gordon J M, Stout Q F. Hypercube message routing in the presence of faults. InProc. of the 3rd Conf. on Hypercube Concurrent Computers and Applications, Jan. 1988, pp. 251–263.

  8. Kermani K, Kleinrock L. Virtual cut-through: A new computer communication switching technique.Computer Network, 1979, 3: 267–286.

    Article  MATH  MathSciNet  Google Scholar 

  9. Lee T C, Hayes J P. A fault-tolerant communication scheme for hypercube computers.IEEE Trans. on Computers, 1992, 41(10): 1242–1256.

    Article  MathSciNet  Google Scholar 

  10. Ni L M, McKinley P K. A survey of routing techniques in wormhole networks.Computer, 1993, 26(2): 62–76.

    Article  Google Scholar 

  11. Raghavendra C S, Yang P J, Tien S B. Free dimensions — An effective approach to achieving fault tolerance in hypercubes. InProc. of the 22nd Int’l Symp. on Fault-Tolerant Computing, 1992, pp. 170–177.

  12. Sengupta A, Bandyopadhyay S. Deadlock-free routing ink-ary hypercube networks in presence of processor failures.Information Processing Letters, 1990, 34: 323–328.

    Article  MATH  MathSciNet  Google Scholar 

  13. Valiant L. A scheme for fast parallel communication.SIAM Journal on Computing, 1992, 34(1): 350–361.

    Google Scholar 

  14. Wu J. Broadcasting in injured hypercubes using limited global information. TR-CSE-92-39, Dept. of Computer Science and Engineering, Florida Atlantic University, Nov. 1992.

  15. Wu J, Fernandez E B. Reliable broadcasting in faulty hypercube computers.Microprocessing and Microprogramming, 1993, 39: 43–53.

    Article  Google Scholar 

  16. Wu J, Yao K. Fault-tolerant multicasting in hypercubes using limited global information. To appear inIEEE Trans. on Computers.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Florida Atlantic University, 33431, Boca Raton, FL, U.S.A.

    Wu Jie

Authors
  1. Wu Jie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wu Jie.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, J. Reliable communication on cube-based multicomputers. J. of Comput. Sci. & Technol. 11, 208–221 (1996). https://doi.org/10.1007/BF02943130

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943130

Keywords

Search

Navigation