This work is devoted to the study of application of new topologies in the design of networks-on-chip (NoCs). It is proposed to use two-dimensional optimal circulant topologies for NoC design, and it is developed an optimized routing algorithm with the decreased memory usage. The proposed routing algorithm was compared with Table routing, Clockwise routing, and Adaptive routing algorithms, previously developed for ring circulant topologies, and specialized routing algorithm for multiplicative circulants. The results of synthesis of routers implementing proposed routing algorithms are presented. The cost of ALM and register resources for the implementation of communication subsystems in NoCs with circulant topologies is estimated.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6962702 | PMC |
| http://dx.doi.org/10.1016/j.heliyon.2020.e03183 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip.
Micromachines (Basel)
January 2023
Department of Physics and Engineering Mathematics, Faculty of Electronic Engineering, Menoufia University, Menouf 32952, Egypt.
This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. Two methods for solving the problem of cyclic dependencies in circulant topologies, which limit their applications for NoCs due to the increased possibility of deadlocks, are proposed.
View Article and Find Full Text PDFStability of twisted states on lattices of Kuramoto oscillators.
Chaos
October 2021
Department of Mathematics and Statistics, The College of New Jersey, Ewing, New Jersey 08618, USA.
Real world systems comprised of coupled oscillators have the ability to exhibit spontaneous synchronization and other complex behaviors. The interplay between the underlying network topology and the emergent dynamics remains a rich area of investigation for both theory and experiment. In this work, we study lattices of coupled Kuramoto oscillators with non-local interactions.
View Article and Find Full Text PDFThe lower bound of the network connectivity guaranteeing in-phase synchronization.
Chaos
June 2021
Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan.
In-phase synchronization is a stable state of identical Kuramoto oscillators coupled on a network with identical positive connections, regardless of network topology. However, this fact does not mean that the networks always synchronize in-phase because other attractors besides the stable state may exist. The critical connectivity μ is defined as the network connectivity above which only the in-phase state is stable for all the networks.
View Article and Find Full Text PDFRouting in triple loop circulants: A case of networks-on-chip.
Heliyon
July 2020
National Research University Higher School of Economics, 34 Tallinskaya Ulitsa, Moscow, 123458, Russian Federation.
In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible implementation using Table routing; algorithms created analytically based on an engineering approach with taking into account the structural features of triple loop circulant graphs (Advanced clockwise, Direction selection); an algorithm created on the basis of a mathematical analysis of graph structure and solving the problem of enumerating coefficients at generators (Coefficients finding algorithm). Efficiency, maximum graph paths, occupied memory resources, and calculation time of the algorithms developed are estimated. Comparison of various variants of the algorithms is made and recommendations on their application for the development of networks-on-chip with triple loop circulant topologies are given.
View Article and Find Full Text PDFDevelopment of routing algorithms in networks-on-chip based on two-dimensional optimal circulant topologies.
Heliyon
January 2020
National Research University Higher School of Economics, 34 Tallinskaya Ulitsa, Moscow, 123458, Russian Federation.
This work is devoted to the study of application of new topologies in the design of networks-on-chip (NoCs). It is proposed to use two-dimensional optimal circulant topologies for NoC design, and it is developed an optimized routing algorithm with the decreased memory usage. The proposed routing algorithm was compared with Table routing, Clockwise routing, and Adaptive routing algorithms, previously developed for ring circulant topologies, and specialized routing algorithm for multiplicative circulants.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!