Routing algorithms for networks-on-chip (NoCs) typically only have a small number of virtual
channels (VCs) at their disposal. Limited VCs pose several challenges to the design of fully …

Routing algorithms for cache-coherent NoCs only have limited VCs at their disposal, which
poses challenges to the design of routing algorithms. Existing fully adaptive routing …

Routing algorithms can improve network performance by maximizing routing adaptiveness
but can be problematic in the presence of endpoint congestion. Tree-saturation is a well …

In this paper, we propose a flexible NoC architecture and a dynamic distributed routing
algorithm which can enhance the NoC communication performance with minimal energy …

As the number of applications and programmable units in CMPs and MPSoCs increases, the
Network-on-Chip (NoC) encounters unpredictable, heterogeneous and time dependent …

Dynamic routing is desirable because of its substantial improvement in communication
bandwidth and intelligent adaptation to faulty links and congested traffics. However …

Non-local adaptive routing techniques, which utilize statuses of both local and distant links
to make routing decisions, have recently been shown to be effective solutions for promoting …

As the number of applications and programmable units in CMPs and MPSoCs increases, the
Network-on-Chip (NoC) encounters diverse and time dependent traffic loads. This trend …

In this paper, an adaptive routing algorithm for two-dimensional mesh network-on-chips
(NoCs) is presented. The algorithm, which is based on Dynamic XY (DyXY), is called …

Networks-on-Chips (NoCs) are experiencing escalating susceptibility to wear-out and
reduced reliability, with the risk of becoming the key point of failure in an entire multicore …