Figure 5 - uploaded by Amin Mehranzadeh
Content may be subject to copyright.
Routing example for dimension-order routing on a 2-D mesh

Routing example for dimension-order routing on a 2-D mesh

Source publication
Article
Full-text available
In this paper we discuss about some input and output selection techniques which used by routing algorithms. Also, to provide new and more efficient algorithms we examine the strengths and weaknesses of the algorithm.

Context in source publication

Context 1
... routing algorithm routes packets by crossing dimensions in increasing order, nullifying the offset in one dimension before routing in the next one. A routing example is shown in Fig.5 Note that dimension-order routing can be executed at the source node, storing information about turns (changes of dimension) in the header [6]. ...

Similar publications

Article
Full-text available
Deep learning has a better output quality compared with traditional algorithms for video super-resolution (SR), but the network model needs large resources and has poor real-time performance. This paper focuses on solving the speed problem of SR; it achieves real-time SR by the collaborative design of a deep learning video SR algorithm and GPU para...
Preprint
Full-text available
We depend on the safe, reliable, and timely operation of cyber-physical systems ranging from smart grids to avionics components. Many of them involve time-dependent behaviours and are subject to randomness. Modelling languages and verification tools thus need to support these quantitative aspects. In my invited presentation at MARS 2022, I gave an...

Citations

... Static arbitration algorithms use a fixed set of rules to determine the order in which packets are transmitted, while dynamic arbitration algorithms adjust these rules based on the current network conditions. For example Round Robin [4] and Fixed Priority [5] arbitration algorithms both are static arbitration. In Round Robin each input channel of a router is given a turn to access the output channel in a circular manner. ...
... T hroughput = T otal received flits Number of network nodes×T otal cycles (5) Where Total received flits indicates the overall count of successfully delivered flits to the destination node, while Total cycles represents the number of clock cycles elapsed from the injection of the first message to the delivery of the last message. The average packet latency is determined by calculating the average latency of delivered packets. ...
... In the transpose traffic pattern, if a node is positioned at coordinates (j, j), it exclusively routes its flits to a node located at coordinates (n-1-j, m-1-i) within the network, where n and m represent the number of columns and rows in a mesh network, respectively. In the hotspot traffic pattern, there is a 10% increase in traffic directed to a node located at coordinates (5,5) compared to the regular random pattern. To evaluate the real traffic scenario, we employed the traffic pattern derived from the MPEG4 communication system [27]. ...
Article
Full-text available
The Network-on-Chip (NoC) is a communication infrastructure designed to integrate various components of a System-on-Chip (SoC) and connect multi-core processors. In on-chip networks, routing is a process that determines how a data packet should move from the source node to the destination node. Essentially, a routing algorithm configures the internal connections of a switch to establish communication towards the destination node by examining the source, destination and the current node addresses. After routing, multiple input channels may simultaneously request access to an output channel based on the routing results. In such cases, an arbitration strategy needs to prioritize access to the output channel for the requesting input channels. This research presents an arbitration strategy called HTPA (Hybrid Traffic Pattern-Aware arbitration) that utilizes local and global information. HTPA also uses a hybrid arbitration scheme consisting of a simple arbitration and a complex switch arbitration. Additionally, it uses age-related techniques to increase the fairness of arbitration and prevent starvation. The proposed method considers certain priorities for accessing output channels based on the distance to the destination, the number of available paths from the current node to the destination, and the traffic intensity parameter. Evaluations were conducted under uniform, transient, hot spot, and MPEG4 traffic patterns and the proposed method demonstrated a reduction in average packet delay compared to RoundRobin, CAIS, and DTIS methods by 79.46%, 71.35%, and 19.91%, respectively, across various traffic patterns.
... In the problem of mapping, latency and bandwidth constraints and communication, the goal is to optimize and save energy. This is complicated because there are many solutions and, in most cases, not all the research to find the optimal solutions, where many heuristic algorithms are provided to find the Figure 1 Two-dimensional mesh-based NoC [15]. delay, so in designing communication protocols for the NoC due to the existing constraints and constraints, Conventional communication protocols for computer networks cannot be used simply [1][2][3][4][5][6]. ...
... Each core is connected to a switch by a network interface. Cores communicate with each other by sending packets via a path consisting of a series of switches and interswitch links [15]. The NOC contains the following fundamental components. ...