Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies

Karpovsky, Mark G.; Levitin, Lev B.; Mustafa, Mehmet

doi:10.1109/tcns.2014.2304869

Cited by 11 publications

(5 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its main idea is to analyze whether the data packet may form a loop, and then when designing the routing algorithm, it can avoid the occurrence of deadlock by prohibiting specific directions. References [18,19,20,21] are based on the Turn model to prohibit specific turns and avoid deadlock.…”

Section: Turn Modelmentioning

confidence: 99%

Design and Performance Analysis of Low Latency Routing Algorithm based NoC for MPSoC

Nagalaxmi¹,

Rao²,

Chandrasekhar³

2023

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

The Network on Chip is appropriate where System-on-Chip technology is scalable and adaptable. The Network on Chip is a new communication architecture with a number of benefits, including scalability, flexibility, and reusability, for applications built on Multiprocessor System on a Chip (MPSoC). However, the design of efficient NoC fabric with high performance is critically complex because of its architectural parameters. Identifying a suitable scheduling algorithm to resolve arbitration among ports to obtain high-speed data transfer in the router is one of the most significant phases while designing a Network on chip based Multiprocessor System on a Chip. Low latency, throughput, space utilization, energy consumption, and reliability for Network on chip fabric are all determined by the router. The performance of the NoC system is hampered by the deadlock issues that plague conventional routing algorithms. This work develops a novel routing algorithm to address the deadlock problem. In this paper, a deterministic shortest path deadlock-free routing method is developed based on the analysis of the Turn Model. In the 2D-mesh structure, the algorithm uses separate routing methods for the odd and even columns. This minimizes the number of paths for a single channel, congestion, and latency. Two test scenarios—one with and one without a load test—were used to evaluate the proposed model. For a zero-load network, three clock cycles are utilized to transfer the packets. For the load network, five clocks are utilized to transfer the packets. The latency is measured for both cases without load and with load test and the corresponding latency is 3ns and 7ns respectively.The proposed method has an 18.57Mbps throughput. The area and power utilization for the proposed method are 69% (IO utilization) and 0.128W respectively. In order to validate the proposed method, the latency is compared with existing work and 50% latency is reduced both with and without congestion load.

show abstract

Section: Turn Modelmentioning

confidence: 99%

Design and Performance Analysis of Low Latency Routing Algorithm based NoC for MPSoC

Nagalaxmi¹,

Rao²,

Chandrasekhar³

2023

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

show abstract

“…End For 10. End Pancake graph is an efficient topology; it has been used recently in several fields (see Femmam et al, 2012;Karpovsky et al, 2014;Deng and Zhang, 2014;Camelo et al, 2014). In this paper, we try to adapt these types of graphs in order to use them as an overlaying P2P architecture because their technique of routing is optimised in terms of number of hops and delay.…”

Section: Algorithm 1: Routing In Pancake Graphsmentioning

confidence: 99%

A new overlay P2P network for efficient routing in group communication with regular topologies

Hacini

Amad

2020

IJGUC

View full text Add to dashboard Cite

This research paper gives a new overlay P2P network to provide a performant and optimised lookup process. The lookup process of the proposed solution reduces the overlay hops and consequently the latency for content lookup, between any pair of nodes. The overlay network is constructed on top of physical networks without any centralised control and with a hierarchy of two levels. The architecture is based on regular topologies which are: the pancake graphs and the skip graphs. The focus of all topology construction schemes is to reduce the cost of the lookup process (number of hops and delay) and consequently improve the search performance for P2P applications deployed on the overlay network. Performance evaluations of our proposed scheme show that results obtained are globally satisfactory.

show abstract

“…Various routing techniques are used in interconnection networks (e.g., [2][3][4][5][6][7][8][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29]). Store-and-forward approach is based on the assumption that an entire message must be received at any intermediate node before it can be forwarded to the next node.…”

Section: Introductionmentioning

confidence: 99%

“…This forms a long "worm" which remains in the network blocking other messages, thereby increasing their delivery time. Also, the problem of deadlocks emerges in this approach and should be dealt with (e.g., [21][22][23][24]).…”

Section: Introductionmentioning

confidence: 99%

An Analytical Model for Virtual Cut-Through Routing

Levitin

Rykalova

2019

2019 28th International Conference on Computer Communication and Networks (ICCCN)

View full text Add to dashboard Cite

An analytical model of a network with 2-dim torus topology and virtual cut-through routing has been considered in order to find out and analyze certain relationships between network parameters, load and performance. An exact expression for the saturation point (message generation rate at which network saturates) and expressions for the latency as a function of the message generation rate under the assumptions of the "mean field" theory have been obtained. It has been found that the saturation point is inversely proportional to the message length and to the distance between the source and destination. The theoretical results are in a good agreement with small-scale simulation experiments.

show abstract

Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies

Cited by 11 publications

References 35 publications

Design and Performance Analysis of Low Latency Routing Algorithm based NoC for MPSoC

Design and Performance Analysis of Low Latency Routing Algorithm based NoC for MPSoC

A new overlay P2P network for efficient routing in group communication with regular topologies

An Analytical Model for Virtual Cut-Through Routing

Contact Info

Product

Resources

About