Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip

Ascia, Giuseppe; Catania, Vincenzo; Palesi, Maurizio; Patti, Davide

doi:10.1109/tc.2008.38

Cited by 211 publications

(132 citation statements)

References 26 publications

Supporting

Mentioning

131

Contrasting

Order By: Relevance

“…In the example, for west output evaluation, it considers nodes (0,0) and (1,1). For south port, it considers nodes (2,2) and (1,1). This strategy works well with an odd-even turn model [1].…”

Section: Insufficient Informationmentioning

confidence: 97%

“…Content may change prior to final publication. local and NoP [1] selection strategies lack enough information, leading to sub-optimal performance. Second, intra-and inter-application interference should be minimized.…”

Section: Ieee Transactions On Computersmentioning

confidence: 99%

“…These conditions may be free buffers [1], [22], [26], [30], [34], free VCs [10], [22], crossbar demands [22] or a combination [22]. Fig.…”

Section: Insufficient Informationmentioning

confidence: 99%

“…1, an adaptive routing algorithm consists of two parts: the routing function and the selection strategy [1]. The routing function computes the set of possible output channels, while the selection strategy chooses one of them based on the network status.…”

Section: Introductionmentioning

confidence: 99%

“…Many oblivious selection strategies have also been evaluated including zigzag, XY, and no turn [10], [18], [21], [39], [49]. Neighborson-Path (NoP) makes a selection based on the condition of the nodes adjacent to neighbors [1].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Holistic Routing Algorithm Design to Support Workload Consolidation in NoCs

Jerger

Wang

et al. 2014

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-To provide efficient, high-performance routing algorithms, a holistic approach should be taken. The key aspects of routing algorithm design include adaptivity, path selection strategy, VC allocation, isolation and hardware implementation cost; these design aspects are not independent. The key contribution of this work lies in the design of a novel selection strategy, Destination-Based Selection Strategy (DBSS) which targets interference that can arise in many-core systems running consolidation workloads. In the process of this design, we holistically consider all aspects to ensure an efficient design. Existing routing algorithms largely overlook issues associated with workload consolidation. Locally adaptive algorithms do not consider enough status information to avoid network congestion. Globally adaptive routing algorithms attack this issue by utilizing network status beyond neighboring nodes. However, they may suffer from interference, coupling the behavior of otherwise independent applications. To address these issues, DBSS leverages both local and non-local network status to provide more effective adaptivity. More importantly, by integrating the destination into the selection procedure, DBSS mitigates interference and offers dynamic isolation among applications. Results show that DBSS offers better performance than the best baseline selection strategy and improves the energy-delay product for medium and high injection rates; it is well suited for workload consolidation.

show abstract

Section: Insufficient Informationmentioning

confidence: 97%

Section: Ieee Transactions On Computersmentioning

confidence: 99%

“…These conditions may be free buffers [1], [22], [26], [30], [34], free VCs [10], [22], crossbar demands [22] or a combination [22]. Fig.…”

Section: Insufficient Informationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Holistic Routing Algorithm Design to Support Workload Consolidation in NoCs

Jerger

Wang

et al. 2014

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

Multipath routing algorithm for application‐specific wormhole NoCs

ZhuanSun

Chen

2017

Concurrency and Computation

View full text Add to dashboard Cite

Adaptive routing designing for network-on-chip architecture is complicated to guarantee deadlock-free. In this paper, we present methodology to design efficient multi-path routing algorithms for specific application wormhole network-on-chip system to guarantee deadlock-free. The methodology presents an analytical model for overall average delay of wormhole network-on-chip by queueing theory and uses a linear programming-based methodology to minimize overall average delay. The methodology guarantees deadlock freedom by efficient branch-and-bound algorithm. Compared to other adaptive deadlock-free algorithms, results obtained through simulation show that the algorithms can potentially achieve better throughput and latency. KEYWORDS multi-path, network-on-chip, routing algorithms 1 opens new directions in the customization of the routing algorithms for the application. 14 Those literature 12,15,16 have proposed several deadlock-free routing algorithms without considering the information of the specific application traffic. They designed those routing algorithms under any type of traffic to guarantee the deadlock freedom of NoC system and improve good average performance. 17 Thus, they naturally assume that each nodes of the NoC system may communicate to each other node and all the source ejecting nodes have same ejecting traffic rate.However, we may get accurate information of the specific application traffic for the area of NoC system. 17 Furthermore, traditional routing algorithm for mesh topology is achieved at a high loss of adaptive. 2,12 A limitation of those routing algorithms is that they cannot ensure deadlock freedom for an irregular mesh topology in which cores could occupy more than one tile. 2

show abstract

Low‐cost regional‐based congestion‐aware routing algorithm for 2D mesh NoC

Vazifedunn

Reza

Reshadi

2022

Int J Communication

View full text Add to dashboard Cite

Summary Given the advantages of network‐on‐chips (NoCs), they are rapidly improving to replace other forms of System‐on‐Chip (SoC) designs. Although various factors improve the NoC's performance, many challenges should be addressed when designing an NoC, one of which is congestion and its impacts on performance and efficiency. Hence, numerous routing algorithms have been proposed that contemplate the congestion influences to deal with its complexities. Nevertheless, given the significant impacts of overheads on performance and efficiency, it is crucial to consider them when designing an enhanced NoC. The proposed routing algorithm employs regional traffic information within multiple clusters and has a decent view of the traffic condition when choosing the path to the destination. Each node generates one bit of traffic information and propagates it only when the node is congested, thus preventing the information overhead. Finally, the path diversity parameter is utilized to identify the best route from the source to the destination. The proposed algorithm's results show that the number of received packets, average latency, average throughput, maximum latency, and energy consumption while using different traffic patterns are improved by 10.9%, 35.3%, 15.8%, 43%, and 15.3%, respectively.

show abstract

Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip

Cited by 211 publications

References 26 publications

Holistic Routing Algorithm Design to Support Workload Consolidation in NoCs

Holistic Routing Algorithm Design to Support Workload Consolidation in NoCs

Multipath routing algorithm for application‐specific wormhole NoCs

Low‐cost regional‐based congestion‐aware routing algorithm for 2D mesh NoC

Contact Info

Product

Resources

About