Abstract
In fault-tolerant interconnection designs, many prior researches suggest good use of disjoint paths to improve the reliability of interconnection networks. Although disjoint paths increase reliability, they always cost the throughput penalty. To address the problems of both performance and fault-tolerant capability, the following issues should be carefully considered: (1) guarantee of at least two disjoint paths, (2) easy rerouting between disjoint paths, (3) keep low rerouting hops, (4) solve the occurrences of packets’ collision. In this paper, we consider these issues to design a fault-tolerant network called CSMIN (Combining Switches Multistage Interconnection Network). CSMIN provides two disjoint paths to guarantee one fault-tolerant and can dynamically reroute packets between these two paths to solve the collision situation. In other words, to switch packets between these two disjoint paths easily, CSMIN causes these two disjoint paths to have regular distances at each stage. Accordingly, a packet can be dynamically sent to the other disjoint path if it encounters a faulty or busy element. In addition, CSMIN presents low rerouting hops (an average of one rerouting hop) to maintain a low collision ratio. From the simulation result, CSMIN performs with a better arrival ratio than Gamma and other related disjoint paths networks do.
Similar content being viewed by others
References
G. B. III Adams, D. P. Agrawal, and H. J. Siegel.R A survey and comparison of fault–tolerant multistage interconnection networks. IEEE Transactions on Computers, 20(6):14–27, 1987.
C. W. Chen, N. P. Lu, T. F. Chen, and C. P. Chung. Fault–tolerant gamma interconnection networks by chaining. In IEE Proceedings on Computers and Digital Techniques, 147(2):75–80, 2000.
P. J. Chuang. CGIN: A fault tolerant modified gamma interconnection network. IEEE Transactions on Parallel and Distributed Systems, 7(12):1301–1306, 1996.
P. J. Chuang. Creating a highly reliable modified gamma interconnection network using a balance approach. In IEE Proceedings of Computers and Digital Techniques, 145(1):27–32, 1998.
F. C. M. Lau and W. C. Poon. Throughput analysis of B-networks. IEEE Transaction on Computers, 47(47):482–485, 1998.
K. Y. Lee and H. Yoon. The PM22I interconnection network. IEEE Transactions on Computers, 38(Issue 2):302–307, 1989.
K. Y. Lee and H. Yoon. The B-network: A multistage interconnection network with backward links. IEEE Transactions on Computers, 39(7):966–969, 1990.
R. J. McMillen and H. J. Siegel. Performance and fault tolerance improvements in the inverse augmented data manipulator network. In 9th Symp. Computer Architecture, pp. 63–72, April 1982.
D. S. Parker and C. S. Raghavendra. The gamma network. IEEE Transactions on Computers, C–33:367–373, April 1984.
C. S. Raghavendra and D. S. Parker. Reliability analysis of an interconnection network. In Proceedings of 4th International Conference on Distributed Computing Systems, pp. 461–471, May 1984.
D. Rau, J. A. B. Fortes, and H. J. Siegel. Destination tag routing techniques based on a state model for the iadm network. IEEE Transactions on Computers, 41(3):274–285, 1992.
S. W. Seo and T. Y. Feng. The composite banyan network. IEEE Transactions on Parallel and Distributed Systems, 6(10):1043–1054, 1995.
K. Yoon and W. Hegazy. The extra stage gamma network. IEEE Transactions on Computers, 37(11):1445–1450, 1988.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the National Science Council NSC-91-2218-E-324-006.
Rights and permissions
About this article
Cite this article
Chen, CW., Chung, CP. Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving. J Supercomput 34, 63–80 (2005). https://doi.org/10.1007/s11227-005-0327-7
Issue Date:
DOI: https://doi.org/10.1007/s11227-005-0327-7