Deadlock-free multi-path routing for torus-based NoCs
In our previous work, a multi-path routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmission. In this paper, a deadlock-free virtual channel model is proposed for the MPR scheme. In this virtual channel model, every physical channel on the network is split into about 3.5 virtual channels on average. It is proved that any minimal routing algorithm (including the MPR scheme) using this model is deadlock-free. The MPR scheme employing this new virtual channel model is still a fully adaptive one. The performance of the MPR scheme using the proposed virtual channel model is evaluated through simulations and compared with the fully adaptive single-path minimal routing (SPR) scheme with the same virtual channel model. Simulation results show that MPR achieves better average message latency and normalized accepted traffic than SPR under both uniform and nonuniform traffic in general.
Network routing; Network-on-chip; Telecommunication channels; Telecommunication traffic
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Deadlock-free multi-path routing for torus-based NoCs.
Fifth International Conference on Information Technology: New Generations 2008, ITNG