{"id":"https://openalex.org/W3215966004","doi":"https://doi.org/10.1109/access.2021.3131635","title":"Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies","display_name":"Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3215966004","doi":"https://doi.org/10.1109/access.2021.3131635","mag":"3215966004"},"language":"en","primary_location":{"id":"doi:10.1109/access.2021.3131635","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3131635","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09628133.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09628133.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002580461","display_name":"\u041e. \u0413. \u041c\u043e\u043d\u0430\u0445\u043e\u0432","orcid":"https://orcid.org/0000-0001-8316-418X"},"institutions":[{"id":"https://openalex.org/I4210110796","display_name":"Institute of Computational Mathematics and Mathematical Geophysics","ror":"https://ror.org/01z686714","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210110796","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Oleg G. Monakhov","raw_affiliation_strings":["Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090 Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090 Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210110796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023361347","display_name":"\u042d. \u0410. \u041c\u043e\u043d\u0430\u0445\u043e\u0432\u0430","orcid":"https://orcid.org/0000-0002-6814-4655"},"institutions":[{"id":"https://openalex.org/I4210110796","display_name":"Institute of Computational Mathematics and Mathematical Geophysics","ror":"https://ror.org/01z686714","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210110796","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Emilia A. Monakhova","raw_affiliation_strings":["Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090 Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 630090 Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210110796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060261504","display_name":"A. Yu. Romanov","orcid":"https://orcid.org/0000-0002-9410-9431"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Aleksandr Yu. Romanov","raw_affiliation_strings":["HSE University, 101000 Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"HSE University, 101000 Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073393016","display_name":"Andrei M. Sukhov","orcid":"https://orcid.org/0000-0001-6948-4988"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Andrej M. Sukhov","raw_affiliation_strings":["HSE University, 101000 Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"HSE University, 101000 Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110353086","display_name":"Evgenii V. Lezhnev","orcid":null},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Evgenii V. Lezhnev","raw_affiliation_strings":["HSE University, 101000 Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"HSE University, 101000 Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5002580461"],"corresponding_institution_ids":["https://openalex.org/I4210110796"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":1.9115,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.86762299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"9","issue":null,"first_page":"160836","last_page":"160846"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7079399228096008},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7063913941383362},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6869759559631348},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6012561321258545},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.588642954826355},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.5529900193214417},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.5447649955749512},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5033888220787048},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5008506774902344},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.500744104385376},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4864053726196289},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.478193998336792},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.468717485666275},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.460269957780838},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4493274986743927},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43011486530303955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4121638834476471},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37758034467697144},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2595110535621643},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25851479172706604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2531775236129761},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1898302435874939},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06794053316116333}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7079399228096008},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7063913941383362},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6869759559631348},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6012561321258545},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.588642954826355},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.5529900193214417},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.5447649955749512},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5033888220787048},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5008506774902344},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.500744104385376},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4864053726196289},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.478193998336792},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.468717485666275},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.460269957780838},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4493274986743927},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43011486530303955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4121638834476471},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37758034467697144},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2595110535621643},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25851479172706604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2531775236129761},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1898302435874939},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06794053316116333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2021.3131635","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3131635","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09628133.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:4d94ff572dbe4e578a8f4d4c5de26dbe","is_oa":true,"landing_page_url":"https://doaj.org/article/4d94ff572dbe4e578a8f4d4c5de26dbe","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 9, Pp 160836-160846 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2021.3131635","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3131635","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09628133.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321770","display_name":"Siberian Branch, Russian Academy of Sciences","ror":"https://ror.org/02frkq021"},{"id":"https://openalex.org/F4320324261","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516"},{"id":"https://openalex.org/F4320336388","display_name":"Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3215966004.pdf","grobid_xml":"https://content.openalex.org/works/W3215966004.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1501077214","https://openalex.org/W1537778554","https://openalex.org/W1584491524","https://openalex.org/W1975339667","https://openalex.org/W1998739279","https://openalex.org/W2010388720","https://openalex.org/W2055206483","https://openalex.org/W2057679792","https://openalex.org/W2080283299","https://openalex.org/W2094613978","https://openalex.org/W2105099851","https://openalex.org/W2113081707","https://openalex.org/W2133003613","https://openalex.org/W2136604606","https://openalex.org/W2158988585","https://openalex.org/W2159582498","https://openalex.org/W2161752124","https://openalex.org/W2169528473","https://openalex.org/W2174749198","https://openalex.org/W2176747588","https://openalex.org/W2254459781","https://openalex.org/W2344923855","https://openalex.org/W2519628439","https://openalex.org/W2600887069","https://openalex.org/W2817830254","https://openalex.org/W2949131874","https://openalex.org/W3000132418","https://openalex.org/W3109075713","https://openalex.org/W3133446571","https://openalex.org/W4236280100","https://openalex.org/W4298710028","https://openalex.org/W6636721027","https://openalex.org/W6691511906","https://openalex.org/W6727362148","https://openalex.org/W6948076897"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W2523719706","https://openalex.org/W2009987517","https://openalex.org/W2767202586","https://openalex.org/W189149726","https://openalex.org/W2368964068","https://openalex.org/W2962525871","https://openalex.org/W2357391150","https://openalex.org/W2161960576","https://openalex.org/W1515277195"],"abstract_inverted_index":{"A":[0,48],"new":[1],"pair":[2],"routing":[3,61,83,145,182],"algorithm":[4,54,113,146,183],"for":[5,82,114,147,164,170,180],"transmitting":[6],"messages":[7],"in":[8,29,133],"multiprocessor":[9],"systems":[10],"and":[11,42,110,123,166],"networks-on-chip":[12,134],"based":[13,92],"on":[14,93],"circulant":[15,137],"networks":[16],"of":[17,32,44,51,58,78,89,97,101,104,143,157,168],"arbitrary":[18],"dimension":[19],"is":[20,55,69,126],"proposed.":[21,127],"It":[22,71],"allows":[23],"using":[24,59,115,184],"all":[25],"reserve":[26,105],"shortest":[27,65,80,106],"paths":[28,66,81,107,117],"the":[30,40,45,52,56,60,76,79,86,98,102,130,144,154,176,181,185],"presence":[31],"destructive":[33],"factors":[34],"(deadlocks,":[35],"livelocks,":[36],"starvation,":[37],"failures)":[38],"at":[39],"nodes":[41,91,159],"channels":[43],"communication":[46],"network.":[47,99],"distinctive":[49],"feature":[50],"proposed":[53,140],"absence":[57],"tables":[62],"with":[63,135],"fixed":[64],"when":[67],"message":[68],"transmitted.":[70],"becomes":[72],"possible":[73],"to":[74,85,118],"determine":[75],"set":[77],"due":[84],"relative":[87],"addresses":[88],"destination":[90],"a":[94,136,141],"parametric":[95],"description":[96],"Estimates":[100],"number":[103,156],"are":[108],"obtained,":[109],"an":[111],"effective":[112],"these":[116],"prevent":[119],"dynamic":[120],"topology":[121],"changes":[122],"network":[124],"congestions":[125],"To":[128],"reduce":[129],"required":[131],"memory":[132,169],"topology,":[138],"we":[139],"version":[142],"two-dimensional":[148],"optimal":[149],"circulants.":[150],"We":[151],"experimentally":[152],"found":[153],"minimum":[155],"reference":[158,186],"(nodes":[160],"containing":[161],"mapping":[162,171],"tables)":[163],"them":[165],"estimates":[167],"tables,":[172],"as":[173,175],"well":[174],"average":[177],"path":[178],"length":[179],"nodes.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}