Fault-tolerant MIN Shuffle-Exchange NoC
Authors:
- 1 May 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647054,p. 1-6
Abstract
In this paper, a fault tolerant routing algorithm for the newly introduced MIN Shuffle-Exchange network is introduced. For more comprehension the MIN Shuffle-Exchange average message latency and power consumption are compared with same feature in MESH and conventional Shuffle-Exchange networks with the same simulation rules and the different traffic patterns and different numbers of faulty links. As a result, the simulation has shown the lower message latency for the MIN Shuffle-Exchange in comparison with two other networks. The power consumption has slightly increased because of the MIN inherent characteristics and wiring length but, it is negligible in comparison with the increment in system performance.Keywords
This publication has 9 references indexed in Scilit:
- Packet chaining2011
- Shuffle-Exchange Mesh Topology for Networks-on-Chip2010
- ShareStreams: A Scalable Architecture and Hardware Support for High-Speed QoS Packet Schedulers2004
- Performance of regular and irregular dynamic MINs2003
- An approach towards benchmarking of fault-tolerant commercial systems2002
- Fault-tolerant Ethernet for IP-based process control: A demonstration2002
- Fault-tolerant de Bruijn and shuffle-exchange networksIEEE Transactions on Parallel and Distributed Systems, 1994
- Nlog N dual shuffle-exchange network with error-correcting routingIEEE Transactions on Communications, 1994
- Routing and path length algorithm for a cost-effective four-tree multistage interconnection networkInternational Journal of Electronics, 1992