Fig 2 - uploaded by Zhigang Yu
Content may be subject to copyright.
The problem of putting 2n balls into m boxes (Ball stands for direction of channel, box stands for zone).
Source publication
This paper presents a general methodology to design deadlock-free routing algorithms for mesh networks. Classifying directions of the network channels, constructing deadlock-free zones, and arranging the produced deadlock-free zones in a specific order are the three fundamental steps that the proposed methodology takes to generate connected and dea...
Context in source publication
Context 1
... include all directions, the routing algorithm is connected. This lemma reveals that if we want to guarantee the connectivity of rout- ing algorithm, all these 2n directions must be included in its zones. Then the problem of making routing algorithm connected becomes the problem of putting 2n balls into m boxes, at least one ball in each boxes (Fig. 2). Here, 2n balls stand for 2n directions in an n-dimensional mesh, m boxes stand for m zones in a routing algorithm. Obliviously, m ≤ n. By this way, we can design lots of routing algorithms and also guarantee its connectivity. For example, R 1 ...
Citations
... Especially, the two dimension mesh (2D mesh) is preferred for the NoC. The properties of topology regularity, linear scalability cost, low node degree and high path diversity [23] have attracted a considerable attention. As a result, this topology has been adopted in several recent experimental and commercial systems [22]. ...
Network congestion is not an uncommon occurrence even when a routing algorithm is well-designed, especially under the condition of a high injection rate. Moreover, it strongly affects the network’s overall performance as a result of increased packet latency. However, the majority of existing congestion avoidance methods either utilize local information or are incredibly complicated. The A-star algorithm is characterized as a heuristic algorithm typically used for the purpose of obtaining an optimal path. In this paper, we propose a novel route selection strategy for network-on-chips is proposed. This strategy is based on the A-star algorithm called ASA-routing. This selection method can be coupled with any deadlock-free adaptive routing algorithm. The ASA-routing utilizes routing table information in order to select as non-congested as possible of output channels for forwarding packets. The congestion information should be dynamically updated according to previously routed packets’ transmission latency. Based on experimental results for different traffic patterns and network loads, the manner in which our method can be applied to the repetitive turn model routing and the odd-even turn routing is outlined, improving both the average latency and the throughput.
