Investigation of the Routing Algorithm in a De Bruijn-based NoC for Low-Power Applications
(2013) 2013 IEEE Faible Tension Faible Consommation (FTFC 2013) — Location: Paris (France) (20.June.2013)
Files
InvestigationoftheRoutingAlgorithminaDeBruijn-basedNoCforLow-PowerApplications.pdf
Restricted Access - Adobe PDF
- 535.22 KB
Details
- Authors
Legat, Jean-Didier 
- Abstract
- The De Bruijn topology, due to its interesting features such as a small minimal path, a small average latency and a small average number of hops, is a promising alternative topology to mesh-based NoCs for low-power applications. However, these advantages strongly depend on the efficiency of the routing algorithm in presence of congestion. This paper investigates efficient implementations of routing algorithms in NoCs based on the De Bruijn topology. Four routing algorithms are proposed and evaluated for NoCs up to 64 nodes. Simulation results show that combining FIFO buffers and Deviation Priority in the General Shifting based Routing Algorithm “GSRA” leads to the best performances. With the proposed routing algorithm, the De Bruijn-based NoCs up to 64 nodes are shown to keep excellent communication bandwidth and latency with packet injection rates above 10%. The average number of hops is significantly smaller than for corresponding mesh-based NoC, thereby making the De Bruijn topology an excellent candidate for low-power applications.
- Affiliations
Citations
Stas, F., Kuti Lusala, A., Legat, J.-D., & Bol, D. (2013). Investigation of the Routing Algorithm in a De Bruijn-based NoC for Low-Power Applications. 2013 IEEE Faible Tension Faible Consommation (FTFC 2013), Paris (France). https://doi.org/10.1109/FTFC.2013.6577761