{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:08:09Z","timestamp":1774595289460,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006769","name":"the RSF","doi-asserted-by":"publisher","award":["22-29-00979"],"award-info":[{"award-number":["22-29-00979"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>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. The developed software is designed to generate circulant topologies for the construction of networks-on-chip (NoCs) and multi-core systems reaching thousands of computing nodes. The developed software makes it possible to achieve high performance on an ordinary research workstation commensurate with similar solutions created for a supercomputer. The use cases of application of the created software for the analysis of routing algorithms in circulants and the regression analysis of the generated dataset of graph signatures to predict the characteristics of graphs of any size are described.<\/jats:p>","DOI":"10.3390\/bdcc7020080","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T03:25:11Z","timestamp":1681961111000},"page":"80","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Dataset for Optimal Circulant Topologies"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9410-9431","authenticated-orcid":false,"given":"Aleksandr","family":"Romanov","sequence":"first","affiliation":[{"name":"HSE University, Moscow 101000, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13677-016-0056-x","article-title":"Fast Methods for Designing Circulant Network Topology with High Connectivity and Survivability","volume":"5","author":"Lu","year":"2016","journal-title":"J. Cloud Comput."},{"key":"ref_2","first-page":"14","article-title":"NoC Routing Protocols\u2014Objective-Based Classification","volume":"66\u201367","author":"Koudil","year":"2016","journal-title":"J. Syst. Archit."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Baby, N., Mathew, S., Abraham, S., Ravindranath, S., and Sanju, V. (2016, January 14\u201316). Network on Chip Simulator: Design, Implementation and Comparison of Mesh, Torus and RiCoBiT Topologies. Proceedings of the 2016 2nd International Conference on Next Generation Computing Technologies, NGCT 2016, Dehradun, India.","DOI":"10.1109\/NGCT.2016.7877388"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/71.536939","article-title":"Optimal Layouts of Midimew Networks","volume":"7","author":"Lau","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"13491","DOI":"10.1007\/s11227-022-04396-5","article-title":"Optimal circulant graphs as low-latency network topologies","volume":"78","author":"Huang","year":"2022","journal-title":"J. Supercomput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"9558","DOI":"10.1007\/s11227-020-03216-y","article-title":"Optimal low-latency network topologies for cluster performance enhancement","volume":"76","author":"Deng","year":"2020","journal-title":"J. Supercomput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1006\/jpdc.2001.1746","article-title":"The Adaptive Bubble Router","volume":"61","author":"Puente","year":"2001","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/71.940745","article-title":"Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers","volume":"12","author":"Yang","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_9","unstructured":"Beivide, R., Mart\u00ednez, C., Izu, C., Gutierrez, J., Gregorio, J.\u00c1., and Miguel-Alonso, J. (2003). High Performance Computing, Proceedings of the 5th International Symposium, ISHPC 2003, Tokyo, Japan, 20\u201322 October 2003, Springer."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.aml.2009.04.006","article-title":"Counting the Number of Spanning Trees in a Class of Double Fixed-Step Loop Networks","volume":"23","author":"Atajan","year":"2010","journal-title":"Appl. Math. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1142\/S0129054198000076","article-title":"Network Properties of Double and Triple Fixed Step Graphs","volume":"09","author":"Liestman","year":"1998","journal-title":"Int. J. Found. Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.21303\/2461-4262.2021.001734","article-title":"Implementation of Chordal Ring Network Topology to Enhance the Performance of Wireless Broadband Network","volume":"2021","author":"Attrah","year":"2021","journal-title":"EUREKA. Phys. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/09728600.2021.1894907","article-title":"Asymptotic Energy of Connected Cubic Circulant Graphs","volume":"18","author":"Bulut","year":"2021","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"101779","DOI":"10.1016\/j.jksus.2021.101779","article-title":"Sharp Bounds on Partition Dimension of Hexagonal M\u00f6bius Ladder","volume":"34","author":"Azeem","year":"2022","journal-title":"J. King Saud Univ.\u2014Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The Structure and Function of Complex Networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0219265905001289","article-title":"Diameter Formulas for a Class of Undirected Double-Loop Networks","volume":"6","author":"Chen","year":"2005","journal-title":"J. Interconnect. Networks"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1006\/jagm.1993.1011","article-title":"Computing the Diameter in Multiple-Loop Networks","volume":"14","author":"Zerovnik","year":"1993","journal-title":"J. Algorithms"},{"key":"ref_18","unstructured":"Loudiki, L., Kchikech, M., and Essaky, E.H. (2022). Diameter Formulas for a Class of Undirected Multi-Loop Networks. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1250002","DOI":"10.1142\/S1793830912500024","article-title":"A Survey on Undirected Circulant Graphs","volume":"4","author":"Monakhova","year":"2012","journal-title":"Discret. Math. Algorithms Appl."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Romanov, A.Y., Romanova, I.I., and Glukhikh, A.Y. (2018, January 24\u201326). Development of a Universal Adaptive Fast Algorithm for the Synthesis of Circulant Topologies for Networks-on-Chip Implementations. Proceedings of the 2018 IEEE 38th International Conference on Electronics and Nanotechnology (ELNANO), Kyiv, Ukraine.","DOI":"10.1109\/ELNANO.2018.8477462"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/12.93744","article-title":"Optimal distance networks of low degree for parallel computers","volume":"40","author":"Herrada","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"ref_22","unstructured":"Park, J.-H., and Chwa, K.-Y. (1994, January 14\u201316). Recursive Circulant: A New Topology for Multicomputer Networks. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), Kanazawa, Japan."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"74028","DOI":"10.1109\/ACCESS.2021.3080315","article-title":"Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs","volume":"9","author":"Cheng","year":"2021","journal-title":"IEEE Access"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0166-218X(96)00138-2","article-title":"Multiplicative circulant networks. Topological properties and communication algorithms","volume":"77","author":"Stojmenovic","year":"1997","journal-title":"Discr. Appl. Math."},{"key":"ref_25","unstructured":"Lewis, R.R. (2021). The Open University."},{"key":"ref_26","first-page":"22118","article-title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","volume":"33","author":"Hu","year":"2020","journal-title":"Adv. Neural Inf. Process Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.micpro.2014.05.005","article-title":"Designing Single-Cycle Long Links in Hierarchical NoCs","volume":"38","author":"Manevich","year":"2014","journal-title":"Microprocess. Microsyst."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ogras, U.Y., Marculescu, R., Lee, H.G., and Chang, N. (2006, January 6\u201310). Communication Architecture Optimization: Making the Shortest Path Shorter in Regular Networks-on-Chip. Proceedings of the Design, Automation and Test in Europe, Munich, Germany.","DOI":"10.1109\/DATE.2006.244068"},{"key":"ref_29","first-page":"3","article-title":"Graphs with Circulant Adjacency Matrices","volume":"9","author":"Elspas","year":"1970","journal-title":"J. Comb. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Salda\u00f1a, M., Shannon, L., and Chow, P. (2006, January 22\u201324). The Routability of Multiprocessor Network Topologies in FPGAs. Proceedings of the Internation Symposium on Field Programmable Gate Arrays\u2014FPGA\u201906, Monterey, CA, USA.","DOI":"10.1145\/1117201.1117253"},{"key":"ref_31","unstructured":"Loudiki, L., Kchikech, M., and Essaky, E.H. (2022). A New Approach for Computing the Distance and the Diameter in Circulant Graphs. arXiv."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A Note on Two Problems in Connexion with Graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_34","first-page":"572","article-title":"Toeplitz Matrices, Asymptotic Linear Algebra and Functional Analysis","volume":"84","author":"Abbott","year":"2000","journal-title":"Math. Gaz."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and Their Connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"ref_36","unstructured":"(2023, March 03). Optimal Circulant Topologies Dataset. Available online: https:\/\/doi.org\/10.5281\/zenodo.7265637."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"5979","DOI":"10.24297\/ijct.v14i8.1857","article-title":"Comparison Studies for Different Shortest Path Algorithms","volume":"14","author":"Tamimi","year":"2015","journal-title":"Int. J. Comput. Technol."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"e01516","DOI":"10.1016\/j.heliyon.2019.e01516","article-title":"Development of Routing Algorithms in Networks-on-Chip Based on Ring Circulant Topologies","volume":"5","author":"Romanov","year":"2019","journal-title":"Heliyon"},{"key":"ref_39","first-page":"215","article-title":"Genetic Construction of Optimal Circulant Network Designs","volume":"Volume 1596","author":"Monakhova","year":"1999","journal-title":"Proceedings of the Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"ref_40","unstructured":"Robic, B. (1996). Optimal Routing in 2-Jump Circulant Networks, Univ. Cambridge."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/11599463_31","article-title":"A constant time optimal routing algorithm for undirected double-loop networks","volume":"3794","author":"Chen","year":"2005","journal-title":"Lect. Notes Comp. Sci."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1007\/11533719_79","article-title":"On Finding a Shortest Path in Circulant Graphs with Two Jumps","volume":"3595","author":"Gomez","year":"2005","journal-title":"Lect. Notes Comp. Sci."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.sysarc.2005.12.003","article-title":"An Optimal Message Routing Algorithm for Circulant Networks","volume":"52","author":"Dobravec","year":"2006","journal-title":"J. Syst. Arch."},{"key":"ref_44","first-page":"86","article-title":"Greedy Routing in Circulant Networks","volume":"8","year":"2022","journal-title":"Graphs Comb."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1109\/TVLSI.2019.2959618","article-title":"Formal Modeling of Network-on-Chip Using CFSM and its Application in Detecting Deadlock","volume":"28","author":"Das","year":"2020","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"ref_46","first-page":"1","article-title":"Fault Tolerance Designs of Interconnection Networks","volume":"1","author":"Nadeem","year":"2023","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Romanov, A., Myachin, N., and Sukhov, A. (2021, January 13\u201316). Fault-Tolerant Routing in Networks-on-Chip Using Self-Organizing Routing Algorithms. Proceedings of the IECON 2021\u201447th Annual Conference of the IEEE Industrial Electronics Society, Toronto, ON, Canada.","DOI":"10.1109\/IECON48115.2021.9589829"},{"key":"ref_48","unstructured":"Montgomery, D.C., Peck, E.A., and Vining, G.G. (2021). Introduction to Linear Regression Analysis, John Wiley & Sons, Inc.. [6th ed.]."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Freedman, D. (2009). Statistical Models: Theory and Practice, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511815867"}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/7\/2\/80\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:19:32Z","timestamp":1760123972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/7\/2\/80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":49,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["bdcc7020080"],"URL":"https:\/\/doi.org\/10.3390\/bdcc7020080","relation":{},"ISSN":["2504-2289"],"issn-type":[{"value":"2504-2289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,20]]}}}