On quantifying fault patterns of the mesh interconnect networks

Safaei, F., Fathy, M., Khonsari, A., Ould-Khaoua, M., Shafiei, H. and Khosravipour, S. (2007) On quantifying fault patterns of the mesh interconnect networks. In: 21st Annual Conference on Advanced Networking and Applications, 2007. AINA '07, Niagra Falls, Ontario, Canada, 21-23 May 2007, pp. 956-961. (doi: 10.1109/AINA.2007.98)

[img]
Preview
Text
safaei3734.pdf

361kB

Publisher's URL: http://dx.doi.org/10.1109/AINA.2007.98

Abstract

One of the key issues in the design of Multiprocessors System-on-Chip (MP-SoCs), multicomputers, and peerto- 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 (|-shape, | |-shape, ý-shape) and concave (L-shape, Ushape, 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.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Ould-Khaoua, Dr Mohamed
Authors: Safaei, F., Fathy, M., Khonsari, A., Ould-Khaoua, M., Shafiei, H., and Khosravipour, S.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Publisher:IEEE Computer Society
ISSN:1550-445X
Copyright Holders:Copyright © 2007 IEEE Computer Society
First Published:First published in 21st Annual Conference on Advanced Networking and Applications, 2007. AINA '07
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record