TY - GEN
T1 - On quantifying fault patterns of the mesh interconnect networks
AU - Safaei, F.
AU - Fathy, M.
AU - Khonsari, A.
AU - Ould-Khaoua, M.
AU - Shafiei, H.
AU - Khosravipour, S.
PY - 2007
Y1 - 2007
N2 - 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, □-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.
AB - 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, □-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.
UR - http://www.scopus.com/inward/record.url?scp=34548805418&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548805418&partnerID=8YFLogxK
U2 - 10.1109/AINA.2007.98
DO - 10.1109/AINA.2007.98
M3 - Conference contribution
AN - SCOPUS:34548805418
SN - 0769528465
SN - 9780769528465
T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA
SP - 956
EP - 961
BT - Proceedings - 21st International Conference on Advanced Information Networking and Applications, AINA 2007
T2 - 21st International Conference on Advanced Information Networking and Applications, AINA 2007
Y2 - 21 May 2007 through 23 May 2007
ER -