A Quantitative Study on NoC Traffic Scenarios

Abstract

In the research of Network-on-Chip (NoC), after a new routing algorithm is devised, its performance should be evaluated by a lot of simulations. In these simulations, a large number of traffic scenarios, such as uniform random, transpose, tornado, etc. have been taken into consideration. However, there is lack of comparative study of these traffic scenarios in the literature. In this paper, the routing pressures of ten routing algorithms are compared under 1,000,000 traffic scenarios. Then simulations are carried out under more than 100 traffic scenarios. The computation and simulation results show that if a routing has small routing pressure and good performance under both transpose1 and transpose2 traffics, then poor performance will not be achieved under any other traffic scenario, with high probability.