Свободная от дедлоков маршрутизация в сетях на кристалле с циркулянтными топологиями
Мячин Н. М., Romanov A., Монахова Э. А.
Вып. 3. , ИППМ РАН, 2021
, Heliyon 2019 Vol. 5 No. 4 P. 1-23
This work is devoted to the study of communication subsystem of networks-on-chip (NoCs) development with an emphasis on their topologies. The main characteristics of NoC topologies and the routing problem in NoCs with various topologies are considered. It is proposed to use two‑dimensional circulant topologies for NoC design, since they have significantly better characteristics than ...
Added: May 8, 2019
, Big Data and Cognitive Computing 2023 Vol. 7 No. 2 Article 80
This article presents software for the synthesis of circulant graphs and the dataset obtained. An algorithm and new methods, which increase the speed of finding optimal circulant topologies, are proposed. The results obtained confirm an increase in performance and a decrease in memory consumption compared to the previous implementation of the circulant topologies synthesis method. ...
Added: June 4, 2023
, , В кн. : Проблемы разработки перспективных микро- и наноэлектронных систем (МЭС-2018). Вып. 3.: М., Зеленоград : ИППМ РАН, 2018. С. 119-125.
Nowadays, construction of multi-core processors is becoming one of the most popular areas of investigation in computer science field; transition to multi-core processors allows overcoming the performance decrease, observed in complex single-core system design. Increase in core number, however, raise the issue of choosing the best topology, because classic topologies (mesh, hypercube, torus) fail to ...
Added: October 28, 2018
, , et al., Journal of Physics: Conference Series 2019 Vol. 1163 No. 1 P. 1-7
The development of multi-core processor systems is a demanded branch of science and technology. The appearance of processors with dozens and hundreds of cores poses to the developers the question of choosing the optimal topology capable to provide efficient routing in a network with a large number of nodes. In this paper, we consider the ...
Added: May 9, 2019
, , et al., Micromachines 2023 Vol. 14 No. 1 Article 141
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 ...
Added: January 31, 2023
, , , Информационные технологии 2020 Т. 26 № 1 С. 22-29
The paper presents the implementation of a dynamic routing algorithm intended for use in networks-on-chip with a three-dimensional circulant topology of type C(N; s1, s2, s3). Compared with the classical algorithms A* or Dijkstra, the proposed algorithm does not require to calculate the entire path of the packet, but calculates the port number to which ...
Added: November 13, 2019
Development of routing algorithms in networks-on-chip based on two-dimensional optimal circulant topologies
, , et al., Heliyon 2020 Vol. 6 No. 1 P. 1-8
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 ...
Added: January 19, 2020
, В кн. : Проблемы разработки перспективных микро- и наноэлектронных систем – 2021 (МЭС-2021). Вып. 1.: ИППМ РАН, 2021. С. 39-45.
This work is devoted to the automation of the process of high-level modeling of network-on-chip (NoC). The main stages of designing NoC are considered. Highlighted the place of high-level modeling in the process of designing NoC. A review and classification of high-level NoC models is carried out. The main parameters of the models, based on ...
Added: August 28, 2021
, , , , in : 2016 IEEE 36th International Scientific Conference on Electronics and Nanotechnology, ELNANO 2016 - Conference Proceedings. : Kiev : NTUU "KPI", 2016. P. 300-303.
This paper proposes an approach to the synthesis and modeling of networks-on-chip (NoCs) by using the NoCSimp library based on a simplified wormhole router with central buffer and without virtual channels. The analysis of the results of simulation and synthesis of NoCs with regular and quasi-optimal topologies with number of nodes 8 and 9 is ...
Added: April 25, 2016
Application of Exhaustive Search, Branch and Bound, Parallel Computing and Monte-Carlo Methods for the Synthesis of Quasi-Optimal Network-on-chip Topologies
, , , , in : Proceedings of XV IEEE East-West Design & Test Symposium (EWDTS'2017). : Piscataway : IEEE, 2017. P. 1-6.
On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte Carlo methods are extended to the synthesis of NoC quasi-optimal topologies. Designed ScaNoC suboptimal topology synthesis algorithm is implemented on ...
Added: October 5, 2017
Проектирование сетей на кристалле с топологией кольцевой циркулянт с тремя образующими: разработка алгоритмов маршрутизации
, , , Информационные технологии 2019 Т. 25 № 9 С. 522-530
This paper presents implementation of several dynamic routing algorithms designed for using in networks-on-chip based on circulant topology of type C(N; 1, s2, s3) to search for the shortest routes between nodes. The developed algorithms can be implemented as RTL state machine for choosing the direction of packets in routers. Algorithms were tested on various sets ...
Added: September 27, 2019
Development of a Universal Adaptive Fast Algorithm for the Synthesis of Circulant Topologies for Networks-on-Chip Implementations
, , , , in : 2018 IEEE 38th International Scientific Conference on Electronics and Nanotechnology, ELNANO 2018 - Conference Proceedings. : IEEE, 2018. P. 110-115.
In this article, the feasibility of realization of optimal circulant topologies in networks-on-chip was researched. The software for automating the synthesis of circulant topologies of various dimensions and of any number of generatrices is presented. The implemented methods to speed up the synthesis process, based on the properties of circulants, as well as improving the ...
Added: May 24, 2018
Routing Algorithms in Optimal Degree Four Circulant Networks Based on Relative Addressing: Comparative Analysis for Networks-on-Chip
, , , IEEE Transactions on Network Science and Engineering 2023 Vol. 10 No. 1 P. 413-425
The solution of the problem of organizing optimal communications in circulant networks of degree four is considered. For a family of optimal circulant networks with the minimum diameter and average distance for any number of nodes in a graph, we propose an optimal pair routing algorithm of constant complexity based on using the relative addressing ...
Added: November 18, 2022
Анализ вариантов реализации подсистемы взаимодействия для многопроцессорной системы на кристалле на основе SchoolMIPS
, , В кн. : Межвузовская научно-техническая конференция студентов, аспирантов и молодых специалистов им. Е.В. Арменского. : МИЭМ НИУ ВШЭ, 2018. С. 101-102.
В данной работе приведено описание многопроцессорной системы на кристалле на основе софт-процессорного ядра schoolMIPS. Дано описание архитектуры системы, основных составляющих модулей, организации памяти и требуемых для взаимодействия процессоров сигналов и входов/выходов. ...
Added: October 25, 2019
, , et al., В кн. : 2020 Moscow Workshop on Electronic and Networking Technologies (MWENT). : IEEE, 2020. Гл. 9067418. С. 1-6.
For analytically defined families of three-dimensional circulant networks with a parametric description, an analytical algorithm for finding shortest paths which has a common scheme for all networks of the family based on a given generating function was developed. A comparative analysis of three routing algorithms (analytical Two-terminal routing algorithm, Coefficients search on graph generators, and ...
Added: September 18, 2020
, , , Journal of Physics: Conference Series 2018 Vol. 1050 No. 1 P. 1-12
The article gives a review of existing methods of network-on-chip design based on the approach in which mapping of the characteristic tasks graph is performed on a given regular topology. The networks-on-chip synthesis problem is generally characterized. The analysis and comparison of standard topologies (mesh and torus) with circulant topologies are performed. Advantages and disadvantages ...
Added: May 25, 2018
, , , , in : 2019 International Russian Automation Conference (RusAutoCon). : IEEE, 2019. P. 1-6.
The paper presents the implementation of a dynamic routing algorithm intended for use in networks-on-chip with a circulant topology with three generatrices of type C(N; s1, s2, s3) for finding the shortest routes between any two network nodes. The algorithm can be implemented as a RTL state machine in routers for NoCs. The proposed algorithm ...
Added: October 23, 2019
, Вестник Южно-Уральского государственного университета. Серия: Компьютерные технологии, управление, радиоэлектроника 2015 Т. 15 № 1 С. 133-139
The article gives a review of existing methods of networks-on-chip design, based on the approach, in which the projection of the characteristic tasks graph is performed on a given regular topology. The general problem of the synthesis of networks-on-chip is characterized. The network topology can be foreknown (usually a regular topology) or selected in accordance ...
Added: February 5, 2015
, , Вестник Национального технического университета Харьковский политехнический институт. Серия: Информатика и моделирование 2011 Т. 17 № 16 С. 86-92
Various approaches to networks on chip organizing are considered. Тhe main drawback of networks on chip packet switching is identified – an excessively large buffers amounts of input and output buffers of routers. The new router architecture with improved resource consumption and high speed action is offered. Figs: 5. Ref.: 12 titles. ...
Added: February 15, 2015
Исследование перспективных топологий сетей на кристалле: применение корневого и прямого произведений графов Пэли
, , В кн. : Проблемы разработки перспективных микро- и наноэлектронных систем – 2021 (МЭС-2021). Вып. 1.: ИППМ РАН, 2021. С. 9-16.
This paper provides an overview of existing network-on-a-chip (NoC) topologies. The study of Paley graphs as a topological graph basis for the design of NoC is carried out. Various modifications of circulant graphsare considered.The main focus of the research is directed to the study of the direct and root products of Paley graphs,the substantiation of ...
Added: August 26, 2021
, Electronics and Communications 2014 Vol. 19 No. 5(82) P. 53-56
The synthesis of network-on-chip topologies, based on the evolutionary computations method is proposed. The optimality criteria of the network-on-chip topologies and a new class of quasi-optimal topologies are proposed. The requirements for quasi-optimal topologies are defined. The genetic algorithm GeNoC for the synthesis of quasi-optimal networks-on-chip topologies with the number of nodes up to 100 ...
Added: March 9, 2015
Usage of Clustering of Paley Graphs in Polar Coordinates for the Development of New Network on Chip Topologies
, , , , in : 2022 International Russian Automation Conference (RusAutoCon). : IEEE, 2022. P. 419-423.
The article presents a study of clustering of Paley graphs with the arrangement of prime numbers in polar coordinates and a comparison of the resulting groups in terms of their static parameters; the application of fault-tolerant self-organizing routing method for new topologies is also considered. This article is a continuation of a series of articles ...
Added: October 2, 2022
, , Heliyon 2020 Vol. 6 No. 7 P. 1-7
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 ...
Added: July 21, 2020