Characterization of spatial fault patterns in interconnection networks

Authors:
M. Hoseiny Farahabady;F. Safaei;A. Khonsari;M. Fathy
Affiliations:
IPM, School of Computer Science, Tehran, Iran and Department of Computer and IT Engineering, Sharif University of Technology, Tehran, Iran;IPM, School of Computer Science, Tehran, Iran and Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;IPM, School of Computer Science, Tehran, Iran and Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Venue:
Parallel Computing
Year:
2006

Citing 9
Cited 4

Discrete mathematics and its applications (2nd ed.)

Discrete mathematics and its applications (2nd ed.)
Software-Based Rerouting for Fault-Tolerant Pipelined Communication

IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks

IEEE Transactions on Computers
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
An Effective Fault-Tolerant Routing Methodology for Direct Networks

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures

IEEE Transactions on Computers
A fault-tolerant permutation routing algorithm in mobile ad-hoc networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
A new adaptive fault-tolerant routing methodology for direct networks

HiPC'04 Proceedings of the 11th international conference on High Performance Computing

Performance analysis of fault-tolerant routing algorithm in wormhole-switched interconnections

The Journal of Supercomputing
On the Probability of Facing Fault Patterns: A Performance and Comparison Measure of Network Fault-Tolerance

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Analytical modeling and comparison of fault-tolerant message flow control mechanisms in torus-connected networks

The Journal of Supercomputing
An efficient routing methodology to tolerate static and dynamic faults in 2-D mesh networks-on-chip

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel computers, such as multiprocessors system-on-chip (Mp-SoCs), multicomputers and cluster computers, are consisting of hundreds or thousands multiple processing units and components (such as routers, channels and connectors) connected via some interconnection network that collectively may undergo high failure rates. Therefore, these systems are required to be equipped with fault-tolerant mechanisms to ensure that the system will keep running in a degraded mode. Normally, the faulty components are coalesced into fault regions, which are classified into two major categories: convex and concave regions. In this paper, we propose the first solution to calculate the probability of occurrences of common fault patterns in torus and mesh interconnection networks which includes both convex (|-shaped, @?-shaped) and concave (L-shaped, T-shaped, +-shaped, H-shaped) regions. These results play a key role when studying, particularly, the performance analysis of routing algorithms proposed for interconnection networks under faulty conditions.