Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Evgenii V. Lezhnev"'
Autor:
Oleg G. Monakhov, Emilia A. Monakhova, Aleksandr Yu. Romanov, Andrej M. Sukhov, Evgenii V. Lezhnev
Publikováno v:
IEEE Access, Vol 9, Pp 160836-160846 (2021)
A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed. It allows using all reserve shortest paths in the presence of destructive factors (d
Externí odkaz:
https://doaj.org/article/4d94ff572dbe4e578a8f4d4c5de26dbe
Publikováno v:
IEEE Access, Vol 8, Pp 215010-215019 (2020)
For a family of optimal two-dimensional circulant networks with an analytical description, two new improved versions of the shortest path search algorithm with a constant complexity estimate are obtained. A simple, based on the geometric model of cir
Externí odkaz:
https://doaj.org/article/f7e449c87ba84f49a2e42e68d14f554b
Autor:
Aleksandr Y. Romanov, Nikolay M. Myachin, Evgenii V. Lezhnev, Alexander D. Ivannikov, Ahmed El-Mesady
Publikováno v:
Micromachines, Vol 14, Iss 1, p 141 (2023)
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 proble
Externí odkaz:
https://doaj.org/article/8f37a6475ff646ccb2fd27b9e10095db