PAAD (Partially adaptive and deterministic routing): A deadlock free congestion aware hybrid routing for 2D mesh network-on-chips.
Authors:
- Misbah ManzoorMMMisbah Manzoor
- Roohie Naaz MirRMRoohie Naaz Mir
- Najeeb-Ud-Din HakimNHNajeeb-Ud-Din Hakim
- 17 May 2022
- journal article
- research article
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 92
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- ParRouting: An Efficient Area Partition-Based Congestion-Aware Routing Algorithm for NoCsMicromachines, 2020
- Reliable Weighted Globally Congestion Aware Routing for Network on ChipInternational Journal of Embedded and Real-Time Communication Systems, 2020
- HARE: History-Aware Adaptive Routing Algorithm for Endpoint Congestion in Networks-on-ChipInternational Journal of Parallel Programming, 2018
- An Efficient Deterministic Edge Traffic Distribution Network-on-chip Routing Algorithm DesignJournal of Communications, 2018
- The Suboptimal Routing Algorithm for 2D Mesh NetworkIEEE Transactions on Computers, 2017
- The odd-even turn model for adaptive routingIEEE Transactions on Parallel and Distributed Systems, 2000
- The turn model for adaptive routingJournal of the ACM, 1994
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987