?
Optimal Routing Algorithm in Dense Gaussian Networks-on-Chip
P. 1–6.
Gromov R. S., Nesterov R.A., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4-2 P. 23–44
This paper explores the performance criteria of the newest algorithm for solving the problem of finding shortest paths on a graph from a given vertex – Bounded Multi-Source Shortest Path Algorithm
(BM-SSP). The algorithm was published in 2025 and, as its creators claim, it is asymptotically superior to Dijkstra’s deterministic algorithm. However, in the publication devoted ...
Added: September 18, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Amerikanov A., Таржанов Т. В., Romanova I. et al., Труды Института системного программирования РАН 2023 Т. 35 № 5 С. 67–80
The paper analyzes the existing methods to optimize the time costs and increase the accuracy of calculations in the high-level simulation of networks-on-chip. The description of parameters and characteristics of networks-on-chip calculated by different models is given, and their influence on the speed of high-level simulation is analyzed. Adaptation of existing methods of modeling optimization ...
Added: March 8, 2024
Mukosey A., Semenov A., Tretiakov A., Journal of Parallel and Distributed Computing 2024 Vol. 183 Article 104765
Several approaches and techniques exist to resolve load balancing problem in general and torus topology networks. Graph methods are natural ways to perform balancing of routing paths. A routing balancing algorithm must operate within the constraints of the underlying network architecture that limits several parameters, such as the number of logical paths in the network. In this paper, we consider a ...
Added: November 25, 2023
Romanov A., 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
Aleksandr Y. Romanov, Nikolay M. Myachin, Evgenii V. Lezhnev 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
Мячин Н. М., Romanov A., Монахова Э. А., В кн.: Проблемы разработки перспективных микро- и наноэлектронных систем – 2021 (МЭС-2021)Вып. 3.: ИППМ РАН, 2021. С. 99–105.
Added: November 12, 2021
Romanov A., Starykh V., 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
Zamyatina E., Poselentseva D., International Journal "Information Models and Analyses" 2019 Vol. 8 No. 2 P. 153–168
The problems of investigations of routing algorithms and data transfer algorithms in mobile self-controlled networks by simulation methods are considered. This class of networks has specific properties: dynamically moving nodes, "limited distance" between nodes, and the absence of a centralized node. The mathematical model of such a network is a dynamic graph. It is important ...
Added: March 11, 2020
Поселенцева Д. Ю., Zamyatina E., Вестник Пермского университета. Серия: Математика. Механика. Информатика 2019 Т. 4 № 47 С. 76–86
The problems of routing and data transmission algorithms in mobile networks are considered. Authors use simulation in order to carry out their researches. The class of mobile networks has characteristic properties: dynamically moving nodes, "limited distance" between nodes, and lack of a centralized node. It is important to predict the conditions when the connection failure ...
Added: February 25, 2020
Romanov A.Yu., Lezhnev E.V., Glukhikh A.Yu. 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
Романов А.Ю., Сидоренко М.В., Монахова Э. А., Информационные технологии 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
Romanov A., Ведмидь Е. А., Монахова Э. А., Информационные технологии 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
Arias-Castro E., Le Gouic T., Discrete and Computational Geometry 2019 Vol. 62 No. 1 P. 1–28
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of Bernstein et al. (Graph approximations to geodesics on embedded manifolds, Tech. Rep., Department of Psychology, ...
Added: May 12, 2019
Aleksandr Yu. Romanov, 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
Zamyatina E.B., Mikov A. I., Kalashnikov S. M., International Journal "Information Technologies & Knowledge" 2018 Vol. 12 No. 2 P. 53–69
It is well known that mobile ad hoc networks are widespread nowadays. Such networks are
created in a short time and function during short time. The number of nodes and interconnections
between these nodes change all the time. The algorithms for ad hoc networks management change
too. Thus, the software tools and language of the simulation systems must ...
Added: December 19, 2018
Щеголева М. А., Romanov A., В кн.: Проблемы разработки перспективных микро- и наноэлектронных систем (МЭС-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
Mikov A., Zamyatina E., , in: Proceedings SDN & NFV – The Next Generation of Computational Infrastructure: 2014 International Science and Technology Conference «Modern Networking Technologies (MoNeTec)».: M.: Moscow Lomonosov University, 2014. P. 94–102.
Abstract— This paper considers software tools and linguistic constructions of the network simulator TRIADNS. Nowadays network applications – especially in the area of wireless networks – are becoming more and more complex which makes the design and the testing almost impossible without appropriate software. This software available to aid the user in simulating previously designed ...
Added: February 20, 2015
Mikov A., Zamyatina E., Mikheev R., , in: Advances in Information Science and Applications. Volumes I & II. Proceedings of the 18th International Conference on Computers (part of CSCC '14)Vol. 1-2.: Santorini Island: CSCC, 2014. P. 391–397.
Abstract— This paper discusses network simulator TRIADNS. It is well known that the role of computer networks becomes more important due to progress in new computer technologies (distributed information systems, GRID-computing, Cloud computing and so on). So it is necessary to have effective and flexible program tools for computer network design and simulation. Indeed this ...
Added: February 20, 2015
Popova T. P., Popov E. V., Rotkov S. I., , in: WSCG 2014 Communication Papers Proceedings.: Plzen: University of West Bohemia, 2014. P. 1–11.
The paper describes the approximate method of the shortest path finding between two points on a surface. This problem occurs when generating a cutting pattern after the form of the fabric tensile surface is found. The shortest path finding is reduced to the problem of finding the geodesic line on the surface. However, the numerical ...
Added: July 23, 2014