A fault-tolerant routing algorithm in 3D topology manycore processors

Fathi, Morteza; Ebrahimi, Sara; Pedram, Hossein

doi:10.1109/kbei.2015.7436049

Cited by 2 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Y coordinate = ID/no columns (2) the available immediate next hop neighbors via west (W), east (E), south (S), and north (N) ports. Every PE is assigned an ID starting from 0.…”

Section: Proposed Solutionmentioning

confidence: 99%

See 1 more Smart Citation

A Network Adaptive Fault-Tolerant Routing Algorithm for Demanding Latency and Throughput Applications of Network-on-a-Chip Designs

et al. 2020

View full text Add to dashboard Cite

Scalability is a significant issue in system-on-a-chip architectures because of the rapid increase in numerous on-chip resources. Moreover, hybrid processing elements demand diverse communication requirements, which system-on-a-chip architectures are unable to handle gracefully. Network-on-a-chip architectures have been proposed to address the scalability, contention, reusability, and congestion-related problems of current system-on-a-chip architectures. The reliability appears to be a challenging aspect of network-on-a-chip architectures because of the physical faults introduced in post-manufacturing processes. Therefore, to overcome such failures in network-on-a-chip architectures, fault-tolerant routing is critical. In this article, a network adaptive fault-tolerant routing algorithm is proposed, where the proposed algorithm enhances an efficient dynamic and adaptive routing algorithm. The proposed algorithm avoids livelocks because of its ability to select an alternate outport. It also manages to bypass congested regions of the network and balances the traffic load between outports that have an equal number of hop counts to its destination. Simulation results verified that in a fault-free scenario, the proposed solution outperformed a fault-tolerant XY by achieving a lower latency. At the same time, it attained a higher flit delivery ratio compared to the efficient dynamic and adaptive routing algorithm. Meanwhile, in the situation of a faulty network, the proposed algorithm could reach a higher flit delivery ratio of up to 18% while still consuming less power compared to the efficient dynamic and adaptive routing algorithm.

show abstract

“…Y coordinate = ID/no columns (2) the available immediate next hop neighbors via west (W), east (E), south (S), and north (N) ports. Every PE is assigned an ID starting from 0.…”

Section: Proposed Solutionmentioning

confidence: 99%

“…This decision is dependent on the location of these PEs and the underlying network topology. In the literature, multiple topologies have been proposed, such as a mesh (two-dimensional (2D) and three-dimensional (3D) [2]), torus, honeycomb [3], butterfly, and hypercube [4][5][6].…”

Section: Introductionmentioning

confidence: 99%