{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T15:19:54Z","timestamp":1770391194226,"version":"3.49.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3131635","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T23:36:50Z","timestamp":1638315410000},"page":"160836-160846","source":"Crossref","is-referenced-by-count":14,"title":["Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8316-418X","authenticated-orcid":false,"given":"Oleg G.","family":"Monakhov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6814-4655","authenticated-orcid":false,"given":"Emilia A.","family":"Monakhova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9410-9431","authenticated-orcid":false,"given":"Aleksandr Yu.","family":"Romanov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6948-4988","authenticated-orcid":false,"given":"Andrej M.","family":"Sukhov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9990-6467","authenticated-orcid":false,"given":"Evgenii V.","family":"Lezhnev","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2005.12.003"},{"key":"ref32","article-title":"Symmetric interconnection networks from cubic crystal lattices","author":"camarero","year":"2013","journal-title":"arXiv 1311 2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/net.20327"},{"key":"ref30","first-page":"410","article-title":"Optimal triple loop networks with given transmission delay: Topological design and routing","author":"monakhova","year":"2003","journal-title":"Proc Int Netw Optim Conf"},{"key":"ref37","article-title":"Distance partitions of extremal and largest known circulant graphs of degree 2 to 9","author":"lewis","year":"2014","journal-title":"arXiv 1408 0988"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11599463_31"},{"key":"ref35","first-page":"175","article-title":"Optimal permutation routing in 2-jump circulant networks","author":"zerovnik","year":"2000","journal-title":"Proc 1st Int Conf Softw Eng Appl Netw Parallel\/Distrib Comput (SNPD)"},{"key":"ref34","first-page":"7","article-title":"Optimal routing in 2-jump circulant networks","author":"robic","year":"1996"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00138-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.820434"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2019.2959618"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724"},{"key":"ref14","first-page":"85","article-title":"A class of parametric regular networks for multicomputer architectures","volume":"4","author":"monakhov","year":"2000","journal-title":"J Comput Syst Sci Int"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.11113\/mjfas.v12n4.518"},{"key":"ref17","first-page":"281","article-title":"Network structures constructed on basis of chordal rings 4th degree","volume":"5","author":"ledzinski","year":"0","journal-title":"Image Processing and Communications Challenges 2"},{"key":"ref18","first-page":"153","article-title":"Distances in generalized double rings and degree three chord rings","author":"pedersen","year":"2005","journal-title":"Proc Int Conf Parallel Distrib Comput Netw"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICACT.2006.206430"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.57"},{"key":"ref4","first-page":"581","author":"dally","year":"2003","journal-title":"Principles and Practices of Interconnection Networks"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.09.007"},{"key":"ref3","first-page":"1","article-title":"Accelerating ML recommendation with over a thousand RISC-V\/tensor processors on esperanto’s ET-SoC-1 chip","author":"ditzel","year":"2021","journal-title":"Proc IEEE Hot Chips 33 Symp (HCS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.258"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946008010018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2019.e01516"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3040323"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2016.04.011"},{"key":"ref2","article-title":"Cerebras’ new monster AI chip adds 1.4 trillion transistors","author":"moore","year":"2021","journal-title":"IEEE Spectr"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00062"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00341-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.1997.645083"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830912500024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2383384"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406954"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.002"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48686-0_36"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09628133.pdf?arnumber=9628133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T21:43:10Z","timestamp":1647294190000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9628133\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3131635","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}