On Quantifying Fault Patterns of the Mesh Interconnect Networks

One of the key issues in the design of multiprocessors system-on-chip (MP-SoCs), multicomputers, and peer-to-peer networks is the development of an efficient communication network to provide high throughput and low latency and its ability to survive beyond the failure of individual components. Generally, the faulty components may be coalesced into fault regions, which are classified into convex and concave shapes. In this paper, we propose a mathematical solution for counting the number of common fault patterns in a 2-D mesh interconnect network including both convex (I-shape, II-shape, square-shape) and concave (L-shape, U- shape, T-shape, +-shape, H-shape) regions. The results presented in this paper which have been validated through simulation experiments can play a key role when studying, particularly, the performance analysis of fault-tolerant routing algorithms and measure of a network fault-tolerance expressed as the probability of a disconnection.

[1]  Alain Greiner,et al.  A generic architecture for on-chip packet-switched interconnections , 2000, DATE '00.

[2]  Jie Wu,et al.  On constructing the minimum orthogonal convex polygon for the fault-tolerant routing in 2-D faulty meshes , 2005, IEEE Transactions on Reliability.

[3]  Antonio Robles,et al.  A transition-based fault-tolerant routing methodology for InfiniBand networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[4]  Jie Wu,et al.  On constructing the minimum orthogonal convex polygon in 2-D faulty meshes , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[5]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[6]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[7]  Sujit Dey,et al.  An Interconnect Architecture for Networking Systems on Chips , 2002, IEEE Micro.

[8]  Suresh Chalasani,et al.  Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks , 1995, IEEE Trans. Computers.

[9]  Partha Pratim Pande,et al.  Performance evaluation and design trade-offs for network-on-chip interconnect architectures , 2005, IEEE Transactions on Computers.

[10]  Young-Joo Suh,et al.  Software-Based Rerouting for Fault-Tolerant Pipelined Communication , 2000, IEEE Trans. Parallel Distributed Syst..

[11]  Jamal N. Al-Karaki.  Performance analysis of repairable cluster of workstations , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[12]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[13]  Axel Jantsch,et al.  A network on chip architecture and design methodology , 2002, Proceedings IEEE Computer Society Annual Symposium on VLSI. New Paradigms for VLSI Systems Design. ISVLSI 2002.

[14]  Antonio Robles,et al.  A New Adaptive Fault-Tolerant Routing Methodology for Direct Networks , 2004, HiPC.

[15]  Djibo Karimou,et al.  A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks , 2005, ICN.

[16]  Laxmikant V. Kalé,et al.  A fault tolerant protocol for massively parallel systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[17]  Russell Tessier,et al.  ASOC: a scalable, single-chip communications architecture , 2000, Proceedings 2000 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00622).

[18]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .