Skip to main content
SpringerLink
Log in

A reliable and fault-tolerant interconnection network

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

Abstract

An interconnection network with multistage redundant paths is introduced for using in high-performance multiprocessor systems. The routing algorithm of the proposed network is simple and dynamically reroutable. The analysis of the fault-tolerance and performance of the network are given. It is shown that the probability of acceptance and the performance-to-cost ratio of the network are better than those of F and Gamma Networks. Another advantages of the proposed network is the smaller amount of interstage links compared with F network.

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. D.H. Lawrie, Access and alignment of data in an array processor,IEEE Trans. Comp., C-24:12 (1975), 1145–1155.

    Article  MATH  MathSciNet  Google Scholar 

  2. C.L.Wu and T.Y. Feng, Routing Techniques for a Class of Multistage Interconnection Networks, Proc. Intl. Conf. on Parallel Processing, Aug. 1978, 197–205.

  3. M.C. Pease, The indirect binaryn-cube microprocessor array,IEEE Trans. Comp., C-26:5 (1977), 458–473.

    Article  MATH  Google Scholar 

  4. J.H. Patel, Performance of processor-memory interconnection for multiprocessors,IEEE Trans. Comp., C-30:10 (1981), 771–780.

    Article  Google Scholar 

  5. J.E. Lilienkampet al., A Fault Tolerant Interconnection Network Using Error Correcting Codes, Proc. 1982 Intl. Conf. on Parallel Processing, Aug. 1982, 123–125.

  6. G.B. Adams III and H.J. Siegel, The extra stage cube: a fault-tolerant interconnection network for supersystems,IEEE Trans. Comp., C-31:5 (1982), 443–454.

    Article  MATH  Google Scholar 

  7. K. Padmanaban and D.H. Lawrie, A Fault-Tolerance Scheme in Suffle-Exchange Type Interconnection Networks, Proc. 1983 Intl. Conf. on Parallel Processing, Aug. 1983, 71–75.

  8. D.S. Parker and C.S. Reghavendra, The Gamma network,IEEE Trans. Comp., C-33:4 (1984), 367–373.

    Article  MATH  Google Scholar 

  9. L. Ciminiera and A. Serra, A connecting network with fault tolerance capabilities,IEEE Trans. Comp., C-35:6 (1986), 578–580.

    Article  Google Scholar 

  10. R.J. McMillen and H.J. Siegel, Routing Schemes for the augmented data manipulator network in an MIMD system.IEEE Trans. Comp., C-31:12 (1982), 1202–1214.

    Article  MATH  Google Scholar 

  11. C.P. Kruskal and M. Snir, The performance of multistage interconnection networks for multiprocessor,IEEE Trans. Comp., C-32:8 (1983), 10–18.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chongqing Institute of Posts and Telecommunications, Chongqing, China

    Deng Yaping

  2. Chongqing University, Chongqing, China

    Chen Tinghuai

Authors
  1. Deng Yaping
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Tinghuai
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deng, Y., Chen, T. A reliable and fault-tolerant interconnection network. J. of Compt. Sci. & Technol. 5, 117–126 (1990). https://doi.org/10.1007/BF02943418

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation