A fault-tolerant adaptive algorithm for both unicast and multicast traffic in Network-on-Chip
A fault-tolerant adaptive algorithm for both unicast and multicast traffic in Network-on-Chip
Mojgan Eivazzadeh1
1) 1Department of Computer Engineering, Osku Branch, Islamic Azad University, Osku, Iran
Publication :
International Conference On Research Science And Technology(rstconf.com)
Abstract :
One of the issues affecting the network on-chip evaluation parameters is how routing
packets in the network. And type of traffic can be used to have an influence on the choice of
routing algorithm. In this thesis different kinds of deterministic and adaptive routing
algorithms with unicast and multicast traffic and fault-tolerant algorithms are evaluated. Also
a new adaptive fault-tolerant routing algorithm for both unicast and multicast traffic is
presented. In this, it has higher performance than deterministic and adaptive unicast and
multicast algorithm. In this algorithm, each switch keeps failure information of own and the
neighboring switch. Based on fault information data adaptive routing continues until the
destination is reached. The number of destinations can be one or more. If we have one
destination then adaptive routing based on fault information data continues to arrive to
destination and if we have multiple destinations, the network is divided into four subnetworks.
In adaptive routing based on fault information messages would be sent to each
destination in each subnet.
The simulation results show that the average latency and energy consumption rate in the
proposed algorithm is less than adaptive and deterministic multicast and unicast algorithm. It
was also the proposed algorithm in the unicast state under various traffic patterns have higher
throughput than Fault-on-neighbor algorithms with different error rates. Average delay under
different traffic patterns and fault notification is lower than Fault-on-neighbor algorithm.
Keywords :