Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths

  • 139 Accesses

  • 30 Citations

Abstract

Multi-stage Interconnection Networks (MINs) are designed to achieve fault-tolerance and collision solving by providing a set of disjoint paths. Ching-Wen Chen and Chung-Ping Chung had proposed a fault-tolerant network called Combining Switches Multi-stage Interconnection Network (CSMIN) and an inaccurate algorithm that provided two correct disjoint paths only for some source-destination pairs. This paper provides a more comprehensive and accurate algorithm that always generate correct routing-tags for two disjoint paths for every source-destination pair in the CSMIN. The 1-fault tolerant CSMIN causes the two disjoint paths to have regular distances at each stage. Moreover, our algorithm backtracks a packet to the previous stage and takes the other disjoint path in the event of a fault or a collision in the network. Furthermore, to eliminate the backtracking penalties of CSMIN, we propose a new design called Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network (FCSMIN). It has similar characteristics of 1-fault tolerance and two disjoint paths between any source-destination pair, but it can tolerate only one link or switch fault at each stage without backtracking. Our simulation and comparative analysis result shows that FCSMIN has added advantages of destination-tag routing, lower hardware costs, strong reroutability, lower preprocessing overhead, and higher fault-tolerance power in comparison to CSMIN.

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

References

  1. 1.

    Feng TY (1981) A survey of interconnection networks. IEEE Comput 14:12–27

  2. 2.

    Hwang K, Briggs FA (1984) Computer architecture and parallel processing. McGraw-Hill, New York, ISBN 0-07-066354-8

  3. 3.

    Adams GB III, Agrawal DP, Siegel HJ (1987) A survey and comparison of fault-tolerant multi-stage interconnection networks. IEEE Comput 20:14–27

  4. 4.

    (1987) Special issue on interconnection networks, IEEE Comput 20

  5. 5.

    Siegel HJ (1990) Interconnection network for large scale parallel processing: theory and case studies. McGraw-Hill, New York, ISBN 0-07-057561-4

  6. 6.

    Hwang K (2000) Advanced computer architecture: parallelism, scalability, programmability. Tata McGraw-Hill, Delhi, ISBN 0-07-053070-X

  7. 7.

    Duato J, Yalamanchili S, Ni LM (2003) Interconnection networks: an engineering approach. Morgan Kaufmann, San Mateo, ISBN 1-55860-852-4

  8. 8.

    Dally W, Towles B (2004) Principles and practices of interconnection networks. Morgan Kaufmann, San Francisco, ISBN 978-0-12-200751-4

  9. 9.

    Nitin, Subramanian A (2008) Efficient algorithms to solve dynamic MINs stability problems using stable matching with complete TIES. J Discrete Algorithms 6(3):353–380

  10. 10.

    Nitin, Sehgal VK, Sharma N, Krishna K Bhatia A (2007) Path-length and routing-tag algorithm for hybrid irregular multi-stage interconnection networks. IEEE Computer Society Press, Los Alamitos, pp 652–657

  11. 11.

    Nitin, Sehgal VK, Bansal PK (2007) On MTTF analysis of a fault-tolerant hybrid MINs. WSEAS Trans Comput Res 2:130–138

  12. 12.

    Nitin (2006) Component level reliability analysis of fault-tolerant hybrid MINs. WSEAS Trans Comput 5:1851–1859

  13. 13.

    Nitin (2006) Reliability analysis of multi-path multi-stage interconnection network. In: Proceedings of the 10th WSEAS international conference on circuits, systems, communication and computers, 2006, pp 1018–1023

  14. 14.

    Nitin (2006) On analytic bounds of regular and irregular fault-tolerant multi-stage interconnection networks. In: Proceedings of the international conference on parallel and distributed processing techniques and applications, 2006, pp 221–226

  15. 15.

    Nitin, Subramanian A (2006) On reliability analysis of cost-effective hybrid zeta network: a fault-tolerant multi-stage interconnection network. In: Proceedings of the international conference on parallel and distributed processing techniques and applications, 2006, pp 260–265

  16. 16.

    Subramanian A, Nitin (2004) On a performance of multi-stage interconnection network. In: Proceedings of the 12th international conference on advanced computing and communication, 2004, pp 73–79

  17. 17.

    Nitin, Chauhan DS, Sehgal VK (2008) Two O(n 2) time fault-tolerant parallel algorithm for inter NoC communication in NiP. Springer, Berlin, pp 262–287

  18. 18.

    Sehgal VK, Nitin (2007) Stochastic communication on application specific networks on chip. Springer, Berlin, pp 11–16, ISBN 978-1-4020-6265-0

  19. 19.

    Chen CW, Chung CP (2005) Designing a disjoint path interconnection network with collision solving and fault tolerance. J Supercomput 34(1):63–80

  20. 20.

    Chen CW (2006) Design schemes of dynamic rerouting networks with destination tag routing for tolerating faults and preventing collisions. J Supercomput 38(3):307–326

  21. 21.

    Siegal HJ, Jose DR, Fortes AB (1992) Destination tag routing techniques based on a state model for the IADM network. IEEE Trans Comput 41(3):274–285

  22. 22.

    Smith B (2006) Design of dynamic rerouting networks with destination tag routing for tolerating faults and preventing collisions. Springer, Berlin

  23. 23.

    Parker DS, Raghavendra CS (1984) The gamma network. IEEE Trans Comput 33:367–373

  24. 24.

    Chuang PJ (1996) CGIN: a fault tolerant modified gamma interconnection network. IEEE Trans Parallel Distrib Syst 7(12):1301–1306

  25. 25.

    Chen CW, Lu NP, Chen TF, Chung CP (2000) Fault-tolerant gamma interconnection networks by chaining. IEE Proc Comput Digital Tech 147(2):75–80

  26. 26.

    Seo SW, Feng TY (1995) The composite banyan network. IEEE Trans Parallel Distrib Syst 6(10):1043–1054

  27. 27.

    Lee KY, Yoon H (1990) The B-Network: a multistage interconnection network with backward links. IEEE Trans Comput 39(7):966–969

  28. 28.

    Lau FCM, Poon WC (1998) Throughput analysis of B-Networks. IEEE Trans Comput 47(47):482–485

Download references

Author information

Correspondence to Nitin.

Additional information

Nitin, Member, SIAM, IEEE and ACM

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Nitin, Garhwal, S. & Srivastava, N. Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths. J Supercomput 55, 400–431 (2011). https://doi.org/10.1007/s11227-009-0336-z

Download citation

Keywords

  • Multi-stage Interconnection Network
  • Combining Switches Multi-stage Interconnection Network
  • Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network
  • Collision solving
  • Routing-tag Algorithm
  • Rerouting tag
  • Distance-tag algorithm and Disjoint Paths