New Methods of Synthesis of Optimal Circulant Graphs for Network-on-Chip Design

Circulant graphs is a promising topology for network applications. This paper is devoted to the development of new software for searching optimal circulant graphs by the criteria of minimizing the average length of shortest paths and diameter. A new version of the algorithm for searching optimal cir...

Full description

Saved in:
Bibliographic Details
Published inLobachevskii journal of mathematics Vol. 45; no. 12; pp. 6581 - 6593
Main Authors Rzaev, E. R., Monakhova, E. A., Romanov, A. Y.
Format Journal Article
LanguageEnglish
Published Moscow Pleiades Publishing 01.12.2024
Subjects
Algebra
Analysis
Geometry
Mathematical Logic and Foundations
Mathematics
Mathematics and Statistics
Probability Theory and Stochastic Processes
graph bisection
circulant graph
graph mean path length
network topology
2010 Mathematics Subject Classification: 05C38, 90C35, 94C15
graph diameter
Online AccessGet full text
ISSN1995-0802
1818-9962
DOI10.1134/S1995080224606313

Cover

More Information
Summary:Circulant graphs is a promising topology for network applications. This paper is devoted to the development of new software for searching optimal circulant graphs by the criteria of minimizing the average length of shortest paths and diameter. A new version of the algorithm for searching optimal circulant graphs with low time complexity is proposed. New data arrays (datasets) of optimal circulant graphs using the newly developed software are obtained. Based on the newly obtained datasets, the target parameters of circulant graphs are investigated. An analytical formula for computing the bisection width for a subclass of circulant graphs is proposed. Analytical relations transforming the problem of finding optimal circulants of degree eight to a problem of constant time complexity are found.
ISSN:1995-0802
1818-9962
DOI:10.1134/S1995080224606313