Hamiltonian path strategy for deadlock-free and adaptive routing in diametrical 2D mesh NoCs
- Author
- Poona Bahrebar (UGent) and Dirk Stroobandt (UGent)
- Organization
- Abstract
- The overall performance of Network-on-Chip (NoC) is strongly affected by the efficiency of the on-chip routing algorithm. Among the factors associated with the design of a high-performance routing method, adaptivity is an important one. Moreover, deadlock- and livelock-freedom are necessary for a functional routing method. Despite the advantages that the diametrical mesh can bring to NoCs compared with the classical mesh topology, the literature records little research efforts to design pertinent routing methods for such networks. Using the available routing algorithms, the network performance degrades drastically not only due to the deterministic paths, but also to the deadlocks created between the packets. In this paper, we take advantage of the Hamiltonian routing strategy to adaptively route the packets through deadlock-free paths in a diametrical 2D mesh network. The simulation results demonstrate the efficiency of the proposed approach in decreasing the likelihood of congestion and smoothly distributing the traffic across the network.
- Keywords
- diametrical 2D mesh topology, Network-on-Chip (NoC), Hamiltonian strategy, adaptive routing, deadlock, ALGORITHMS
Downloads
-
(...).pdf
- full text
- |
- UGent only
- |
- |
- 166.44 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-6843470
- MLA
- Bahrebar, Poona, and Dirk Stroobandt. “Hamiltonian Path Strategy for Deadlock-Free and Adaptive Routing in Diametrical 2D Mesh NoCs.” IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, IEEE Computer Society, 2015, pp. 1209–12, doi:10.1109/CCGrid.2015.112.
- APA
- Bahrebar, P., & Stroobandt, D. (2015). Hamiltonian path strategy for deadlock-free and adaptive routing in diametrical 2D mesh NoCs. IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, 1209–1212. https://doi.org/10.1109/CCGrid.2015.112
- Chicago author-date
- Bahrebar, Poona, and Dirk Stroobandt. 2015. “Hamiltonian Path Strategy for Deadlock-Free and Adaptive Routing in Diametrical 2D Mesh NoCs.” In IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, 1209–12. Piscataway, NJ, USA: IEEE Computer Society. https://doi.org/10.1109/CCGrid.2015.112.
- Chicago author-date (all authors)
- Bahrebar, Poona, and Dirk Stroobandt. 2015. “Hamiltonian Path Strategy for Deadlock-Free and Adaptive Routing in Diametrical 2D Mesh NoCs.” In IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, 1209–1212. Piscataway, NJ, USA: IEEE Computer Society. doi:10.1109/CCGrid.2015.112.
- Vancouver
- 1.Bahrebar P, Stroobandt D. Hamiltonian path strategy for deadlock-free and adaptive routing in diametrical 2D mesh NoCs. In: IEEE-ACM International Symposium on Cluster Cloud and Grid Computing. Piscataway, NJ, USA: IEEE Computer Society; 2015. p. 1209–12.
- IEEE
- [1]P. Bahrebar and D. Stroobandt, “Hamiltonian path strategy for deadlock-free and adaptive routing in diametrical 2D mesh NoCs,” in IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, Shenzhen, China, 2015, pp. 1209–1212.
@inproceedings{6843470, abstract = {{The overall performance of Network-on-Chip (NoC) is strongly affected by the efficiency of the on-chip routing algorithm. Among the factors associated with the design of a high-performance routing method, adaptivity is an important one. Moreover, deadlock- and livelock-freedom are necessary for a functional routing method. Despite the advantages that the diametrical mesh can bring to NoCs compared with the classical mesh topology, the literature records little research efforts to design pertinent routing methods for such networks. Using the available routing algorithms, the network performance degrades drastically not only due to the deterministic paths, but also to the deadlocks created between the packets. In this paper, we take advantage of the Hamiltonian routing strategy to adaptively route the packets through deadlock-free paths in a diametrical 2D mesh network. The simulation results demonstrate the efficiency of the proposed approach in decreasing the likelihood of congestion and smoothly distributing the traffic across the network.}}, author = {{Bahrebar, Poona and Stroobandt, Dirk}}, booktitle = {{IEEE-ACM International Symposium on Cluster Cloud and Grid Computing}}, isbn = {{9781479980062}}, issn = {{2376-4414}}, keywords = {{diametrical 2D mesh topology,Network-on-Chip (NoC),Hamiltonian strategy,adaptive routing,deadlock,ALGORITHMS}}, language = {{eng}}, location = {{Shenzhen, China}}, pages = {{1209--1212}}, publisher = {{IEEE Computer Society}}, title = {{Hamiltonian path strategy for deadlock-free and adaptive routing in diametrical 2D mesh NoCs}}, url = {{http://doi.org/10.1109/CCGrid.2015.112}}, year = {{2015}}, }
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: