{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:31:02Z","timestamp":1775633462512,"version":"3.50.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11227-022-04396-5","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T10:02:33Z","timestamp":1647856953000},"page":"13491-13510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Optimal circulant graphs as low-latency network topologies"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1174-7148","authenticated-orcid":false,"given":"Xiaolong","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4681-3069","authenticated-orcid":false,"given":"Alexandre","family":"F. Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5224-3958","authenticated-orcid":false,"given":"Yuefan","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"key":"4396_CR1","unstructured":"Top 500 supercomputer site (2021) http:\/\/www.top500.org"},{"issue":"8","key":"4396_CR2","first-page":"114","volume":"38","author":"GE Moore","year":"1965","unstructured":"Moore GE (1965) Cramming more components onto integrated circuits. Electronics 38(8):114\u2013117","journal-title":"Electronics"},{"issue":"31","key":"4396_CR3","doi-asserted-by":"publisher","first-page":"1250169","DOI":"10.1142\/s021797921250169x","volume":"26","author":"Y Deng","year":"2012","unstructured":"Deng Y, Ramos AF, Hornos JEM (2012) Symmetry insights for design of supercomputer network topologies: roots and weights lattices. Int J Mod Phys B 26(31):1250169. https:\/\/doi.org\/10.1142\/s021797921250169x","journal-title":"Int J Mod Phys B"},{"key":"4396_CR4","volume-title":"Principles and practices of interconnection networks","author":"W Dally","year":"2003","unstructured":"Dally W, Towles B (2003) Principles and practices of interconnection networks. Elsevier Science & Technology, Amsterdam"},{"issue":"3","key":"4396_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/mm.2006.65","volume":"26","author":"R Brightwell","year":"2006","unstructured":"Brightwell R, Pedretti K, Underwood K et al (2006) SeaStar interconnect: balanced bandwidth for scalable performance. IEEE Micro 26(3):41\u201357. https:\/\/doi.org\/10.1109\/mm.2006.65","journal-title":"IEEE Micro"},{"issue":"1.2","key":"4396_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1147\/rd.521.0199","volume":"52","author":"IBM Blue Gene Team","year":"2008","unstructured":"IBM Blue Gene Team (2008) Overview of the IBM Blue Gene\/P project. IBM J Res Dev 52(1.2):199\u2013220. https:\/\/doi.org\/10.1147\/rd.521.0199","journal-title":"IBM J Res Dev"},{"key":"4396_CR7","doi-asserted-by":"publisher","unstructured":"Alverson R, Roweth D, Kaplan L (2010) The gemini system interconnect. In: (2010) 18th IEEE Symposium on High Performance Interconnects. IEEE, Mountain View, CA, USA,. https:\/\/doi.org\/10.1109\/hoti.2010.23","DOI":"10.1109\/hoti.2010.23"},{"key":"4396_CR8","doi-asserted-by":"publisher","unstructured":"Chen D, Parker JJ, Eisley NA et\u00a0al (2011) The IBM Blue Gene\/Q interconnection network and message unit. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis on - SC$$^{\\prime }$$11. ACM Press, Seattle, WA, USA, https:\/\/doi.org\/10.1145\/2063384.2063419","DOI":"10.1145\/2063384.2063419"},{"issue":"11","key":"4396_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/mc.2009.370","volume":"42","author":"Y Ajima","year":"2009","unstructured":"Ajima Y, Sumimoto S, Shimizu T (2009) Tofu: a 6D mesh\/torus interconnect for exascale computers. Computer 42(11):36\u201340. https:\/\/doi.org\/10.1109\/mc.2009.370","journal-title":"Computer"},{"key":"4396_CR10","doi-asserted-by":"publisher","unstructured":"Ajima Y, Kawashima T, Okamoto T et\u00a0al (2018) The tofu interconnect d. In: 2018 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, Belfast, UK, https:\/\/doi.org\/10.1109\/cluster.2018.00090","DOI":"10.1109\/cluster.2018.00090"},{"issue":"12","key":"4396_CR11","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1109\/5.48826","volume":"77","author":"J Hayes","year":"1989","unstructured":"Hayes J, Mudge T (1989) Hypercube supercomputers. Proc IEEE 77(12):1829\u20131841. https:\/\/doi.org\/10.1109\/5.48826","journal-title":"Proc IEEE"},{"issue":"10","key":"4396_CR12","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/tc.1985.6312192","volume":"34","author":"CE Leiserson","year":"1985","unstructured":"Leiserson CE (1985) Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans Comput C 34(10):892\u2013901. https:\/\/doi.org\/10.1109\/tc.1985.6312192","journal-title":"IEEE Trans Comput C"},{"key":"4396_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-5588-7","author":"H Fu","year":"2016","unstructured":"Fu H, Liao J, Yang J et al (2016) The sunway TaihuLight supercomputer: system and applications. Sci China Inf Sci. https:\/\/doi.org\/10.1007\/s11432-016-5588-7","journal-title":"Sci China Inf Sci"},{"issue":"8","key":"4396_CR14","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/tc.1980.1675651","volume":"29","author":"CL Wu","year":"1980","unstructured":"Wu CL, Feng TY (1980) On a class of multistage interconnection networks. IEEE Trans Comput C 29(8):694\u2013702. https:\/\/doi.org\/10.1109\/tc.1980.1675651","journal-title":"IEEE Trans Comput C"},{"issue":"6","key":"4396_CR15","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1109\/12.53599","volume":"39","author":"W Dally","year":"1990","unstructured":"Dally W (1990) Performance analysis of k-ary n-cube interconnection networks. IEEE Trans Comput 39(6):775\u2013785. https:\/\/doi.org\/10.1109\/12.53599","journal-title":"IEEE Trans Comput"},{"key":"4396_CR16","doi-asserted-by":"publisher","unstructured":"Kim J, Dally WJ, Scott S, (2008) Technology-driven, highly-scalable dragonfly topology. In: (2008) International Symposium on Computer Architecture. IEEE, Beijing, China. https:\/\/doi.org\/10.1109\/isca.2008.19","DOI":"10.1109\/isca.2008.19"},{"key":"4396_CR17","doi-asserted-by":"publisher","unstructured":"Faanes G, Bataineh A, Roweth D, (2012) Cray cascade: a scalable HPC system based on a dragonfly network. In: (2012) International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, Salt Lake City, UT, USA. https:\/\/doi.org\/10.1109\/sc.2012.39","DOI":"10.1109\/sc.2012.39"},{"key":"4396_CR18","doi-asserted-by":"publisher","unstructured":"Sensi DD, Girolamo SD, McMahon KH et\u00a0al (2020) An in-depth analysis of the slingshot interconnect. In: SC20: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, Atlanta, GA, USA, https:\/\/doi.org\/10.1109\/sc41405.2020.00039","DOI":"10.1109\/sc41405.2020.00039"},{"issue":"4","key":"4396_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.3230040405","volume":"4","author":"VG Cerf","year":"1974","unstructured":"Cerf VG, Cowan DD, Mullin RC et al (1974) A lower bound on the average shortest path length in regular graphs. Networks 4(4):335\u2013342. https:\/\/doi.org\/10.1002\/net.3230040405","journal-title":"Networks"},{"issue":"2","key":"4396_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/tpds.2010.89","volume":"22","author":"P Zhang","year":"2011","unstructured":"Zhang P, Powell R, Deng Y (2011) Interlacing bypass rings to torus networks for more efficient networks. IEEE Trans Parallel Distrib Syst 22(2):287\u2013295. https:\/\/doi.org\/10.1109\/tpds.2010.89","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"12","key":"4396_CR21","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.aml.2012.05.013","volume":"25","author":"P Zhang","year":"2012","unstructured":"Zhang P, Deng Y (2012) An analysis of the topological properties of the interlaced bypass torus (iBT) networks. Appl Math Lett 25(12):2147\u20132155. https:\/\/doi.org\/10.1016\/j.aml.2012.05.013","journal-title":"Appl Math Lett"},{"issue":"12","key":"4396_CR22","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/tpds.2012.93","volume":"23","author":"P Zhang","year":"2012","unstructured":"Zhang P, Deng Y (2012) Design and analysis of pipelined broadcast algorithms for the all-port interlaced bypass torus networks. IEEE Trans Parallel Distrib Syst 23(12):2245\u20132253. https:\/\/doi.org\/10.1109\/tpds.2012.93","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"4396_CR23","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/tpds.2014.2315201","volume":"26","author":"P Zhang","year":"2015","unstructured":"Zhang P, Deng Y, Feng R et al (2015) Evaluation of various networks configurated by adding bypass or torus links. IEEE Trans Parallel Distrib Syst 26(4):984\u2013996. https:\/\/doi.org\/10.1109\/tpds.2014.2315201","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4396_CR24","doi-asserted-by":"publisher","unstructured":"Feng R, Zhang P, Deng Y (2013) Deadlock-free routing algorithms for 6d mesh\/iBT interconnection networks. In: 2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing. IEEE, Honolulu, HI, USA, https:\/\/doi.org\/10.1109\/snpd.2013.43","DOI":"10.1109\/snpd.2013.43"},{"key":"4396_CR25","doi-asserted-by":"publisher","unstructured":"Feng R, Zhang P, Deng Y (2012) Simulated performance evaluation of a 6d mesh\/iBT interconnect. In: 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing. IEEE, Kyoto, Japan, https:\/\/doi.org\/10.1109\/snpd.2012.19","DOI":"10.1109\/snpd.2012.19"},{"issue":"12","key":"4396_CR26","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.3390\/math7121214","volume":"7","author":"Z Xu","year":"2019","unstructured":"Xu Z, Huang X, Jimenez F et al (2019) A new record of graph enumeration enabled by parallel processing. Mathematics 7(12):1214. https:\/\/doi.org\/10.3390\/math7121214","journal-title":"Mathematics"},{"issue":"12","key":"4396_CR27","doi-asserted-by":"publisher","first-page":"9558","DOI":"10.1007\/s11227-020-03216-y","volume":"76","author":"Y Deng","year":"2020","unstructured":"Deng Y, Guo M, Ramos AF et al (2020) Optimal low-latency network topologies for cluster performance enhancement. J Supercomput 76(12):9558\u20139584. https:\/\/doi.org\/10.1007\/s11227-020-03216-y","journal-title":"J Supercomput"},{"issue":"1","key":"4396_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3390\/sym12010002","volume":"12","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Huang X, Xu Z et al (2019) A structured table of graphs with symmetries and other special properties. Symmetry 12(1):2. https:\/\/doi.org\/10.3390\/sym12010002","journal-title":"Symmetry"},{"issue":"4","key":"4396_CR29","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/tpds.2016.2613043","volume":"28","author":"NT Truong","year":"2017","unstructured":"Truong NT, Fujiwara I, Koibuchi M et al (2017) Distributed shortcut networks: low-latency low-degree non-random topologies targeting the diameter and cable length trade-off. IEEE Trans Parallel Distrib Syst 28(4):989\u20131001. https:\/\/doi.org\/10.1109\/tpds.2016.2613043","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"4396_CR30","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/tpds.2018.2864286","volume":"30","author":"R Yasudo","year":"2019","unstructured":"Yasudo R, Koibuchi M, Nakano K et al (2019) Designing high-performance interconnection networks with host-switch graphs. IEEE Trans Parallel Distrib Syst 30(2):315\u2013330. https:\/\/doi.org\/10.1109\/tpds.2018.2864286","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"07","key":"4396_CR31","doi-asserted-by":"publisher","first-page":"1850048","DOI":"10.1142\/s0129183118500481","volume":"29","author":"AU Sabino","year":"2018","unstructured":"Sabino AU, Vasconcelos MFS, Deng Y et al (2018) Symmetry-guided design of topologies for supercomputer networks. Int J Mod Phys C 29(07):1850048. https:\/\/doi.org\/10.1142\/s0129183118500481","journal-title":"Int J Mod Phys C"},{"issue":"102","key":"4396_CR32","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.parco.2021.102805","volume":"106","author":"M Nakao","year":"2021","unstructured":"Nakao M, Sakai M, Hanada Y et al (2021) Graph optimization algorithm for low-latency interconnection networks. Parallel Comput 106(102):805. https:\/\/doi.org\/10.1016\/j.parco.2021.102805","journal-title":"Parallel Comput"},{"issue":"1","key":"4396_CR33","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J Bermond","year":"1995","unstructured":"Bermond J, Comellas F, Hsu D (1995) Distributed loop computer-networks: a survey. J Parallel Distrib Comput 24(1):2\u201310. https:\/\/doi.org\/10.1006\/jpdc.1995.1002","journal-title":"J Parallel Distrib Comput"},{"issue":"1\u20133","key":"4396_CR34","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/s0304-3975(01)00341-3","volume":"299","author":"F Hwang","year":"2003","unstructured":"Hwang F (2003) A survey on multi-loop networks. Theor Comput Sci 299(1\u20133):107\u2013121. https:\/\/doi.org\/10.1016\/s0304-3975(01)00341-3","journal-title":"Theor Comput Sci"},{"issue":"01","key":"4396_CR35","doi-asserted-by":"publisher","first-page":"1250002","DOI":"10.1142\/s1793830912500024","volume":"04","author":"EA Monakhova","year":"2012","unstructured":"Monakhova EA (2012) A survey on undirected circulant graphs. Discret Math Algorithms Appl 04(01):1250002. https:\/\/doi.org\/10.1142\/s1793830912500024","journal-title":"Discret Math Algorithms Appl"},{"issue":"12","key":"4396_CR36","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1109\/tcs.1985.1085667","volume":"32","author":"F Boesch","year":"1985","unstructured":"Boesch F, Wang JF (1985) Reliable circulant networks with minimum transmission delay. IEEE Trans Circuits Syst 32(12):1286\u20131291. https:\/\/doi.org\/10.1109\/tcs.1985.1085667","journal-title":"IEEE Trans Circuits Syst"},{"issue":"10","key":"4396_CR37","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/12.93744","volume":"40","author":"R Beivide","year":"1991","unstructured":"Beivide R, Herrada E, Balcazar J et al (1991) Optimal distance networks of low degree for parallel computers. IEEE Trans Comput 40(10):1109\u20131124. https:\/\/doi.org\/10.1109\/12.93744","journal-title":"IEEE Trans Comput"},{"issue":"9","key":"4396_CR38","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/71.536939","volume":"7","author":"F Lau","year":"1996","unstructured":"Lau F, Chen G (1996) Optimal layouts of midimew networks. IEEE Trans Parallel Distrib Syst 7(9):954\u2013961. https:\/\/doi.org\/10.1109\/71.536939","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"12","key":"4396_CR39","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/12.477250","volume":"44","author":"K Mukhopadhyaya","year":"1995","unstructured":"Mukhopadhyaya K, Sinha B (1995) Fault-tolerant routing in distributed loop networks. IEEE Trans Comput 44(12):1452\u20131456. https:\/\/doi.org\/10.1109\/12.477250","journal-title":"IEEE Trans Comput"},{"issue":"1\u20133","key":"4396_CR40","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2007.04.002","volume":"381","author":"D G\u00f3mez","year":"2007","unstructured":"G\u00f3mez D, Gutierrez J, Ibeas \u00c1 (2007) Optimal routing in double loop networks. Theor Comput Sci 381(1\u20133):68\u201385. https:\/\/doi.org\/10.1016\/j.tcs.2007.04.002","journal-title":"Theor Comput Sci"},{"issue":"2","key":"4396_CR41","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/net.20076","volume":"46","author":"N Obradovi\u00e7","year":"2005","unstructured":"Obradovi\u00e7 N, Peters J, Ru\u017ei\u0107 G (2005) Reliable broadcasting in double loop networks. Networks 46(2):88\u201397. https:\/\/doi.org\/10.1002\/net.20076","journal-title":"Networks"},{"key":"4396_CR42","doi-asserted-by":"publisher","unstructured":"Monakhov O, Monakhova E, (2019) A comparative analysis of bioinspired algorithms for solving the problem of optimization of circulant and hypercirculant networks. In: (2019) 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS), IEEE. https:\/\/doi.org\/10.1109\/opcs.2019.8880247","DOI":"10.1109\/opcs.2019.8880247"},{"key":"4396_CR43","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.endm.2014.08.031","volume":"46","author":"R Feria-Pur\u00f3n","year":"2014","unstructured":"Feria-Pur\u00f3n R, Ryan J, P\u00e9rez-Ros\u00e9s H (2014) Searching for large multi-loop networks. Electron Notes Discret Math 46:233\u2013240. https:\/\/doi.org\/10.1016\/j.endm.2014.08.031","journal-title":"Electron Notes Discret Math"},{"key":"4396_CR44","doi-asserted-by":"publisher","unstructured":"Bevan D, Erskine G, Lewis R (2017) Large circulant graphs of fixed diameter and arbitrary degree. Ars Math Contemp 13(2):275\u2013291. https:\/\/doi.org\/10.26493\/1855-3974.969.659,","DOI":"10.26493\/1855-3974.969.659"},{"issue":"9","key":"4396_CR45","doi-asserted-by":"publisher","first-page":"2553","DOI":"10.1016\/j.disc.2018.05.024","volume":"341","author":"RR Lewis","year":"2018","unstructured":"Lewis RR (2018) The degree-diameter problem for circulant graphs of degrees 10 and 11. Discret Math 341(9):2553\u20132566. https:\/\/doi.org\/10.1016\/j.disc.2018.05.024","journal-title":"Discret Math"},{"key":"4396_CR46","doi-asserted-by":"publisher","DOI":"10.1201\/b16132","volume-title":"Handbook of graph theory","author":"JL Gross","year":"2013","unstructured":"Gross JL, Yellen J, Zhang P (2013) Handbook of graph theory. CRC Press, Boca Raton"},{"issue":"4","key":"4396_CR47","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F Boesch","year":"1984","unstructured":"Boesch F, Tindell R (1984) Circulants and their connectivities. J Graph Theory 8(4):487\u2013499. https:\/\/doi.org\/10.1002\/jgt.3190080406","journal-title":"J Graph Theory"},{"key":"4396_CR48","volume-title":"Matters computational: ideas, algorithms, source code","author":"J Arndt","year":"2010","unstructured":"Arndt J (2010) Matters computational: ideas, algorithms, source code. Springer Science & Business Media, Berlin"},{"key":"4396_CR49","unstructured":"Fxt: a library of algorithms (2021) https:\/\/www.jjj.de\/fxt\/"},{"key":"4396_CR50","unstructured":"Ruskey F (2003) Combinatorial generation. Preliminary working draft University of Victoria, Victoria, BC, Canada 11:20"},{"key":"4396_CR51","doi-asserted-by":"publisher","unstructured":"Sanders P, Schulz C (2013) Think locally, act globally: highly balanced graph partitioning. In: Experimental Algorithms. Lecture notes in computer science, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 164\u2013175, https:\/\/doi.org\/10.1007\/978-3-642-38527-8_16","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"4396_CR52","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay BD, Piperno A (2014) Practical graph isomorphism, II. J Symb Comput 60:94\u2013112. https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"J Symb Comput"},{"issue":"10","key":"4396_CR53","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1016\/j.jpdc.2014.06.008","volume":"74","author":"H Casanova","year":"2014","unstructured":"Casanova H, Giersch A, Legrand A et al (2014) Versatile, scalable, and accurate simulation of distributed applications and platforms. J Parallel Distrib Comput 74(10):2899\u20132917. https:\/\/doi.org\/10.1016\/j.jpdc.2014.06.008","journal-title":"J Parallel Distrib Comput"},{"key":"4396_CR54","unstructured":"Effective Bandwidth (b_eff) Benchmark (2021) https:\/\/fs.hlrs.de\/projects\/par\/mpi\/b_eff\/"},{"key":"4396_CR55","doi-asserted-by":"publisher","unstructured":"Koniges A, Rabenseifner R, Solchenbach K (2001) Benchmark design for characterization of balanced high-performance architectures. In: Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001. IEEE Comput. Soc, San Francisco, CA, USA. https:\/\/doi.org\/10.1109\/ipdps.2001.925208","DOI":"10.1109\/ipdps.2001.925208"},{"key":"4396_CR56","unstructured":"FFTE : A fast fourier transform package (2021) http:\/\/www.ffte.jp\/"},{"issue":"2","key":"4396_CR57","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/a:1008160021085","volume":"15","author":"D Takahashi","year":"2000","unstructured":"Takahashi D, Kanada Y (2000) High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers. J Supercomput 15(2):207\u2013228. https:\/\/doi.org\/10.1023\/a:1008160021085","journal-title":"J Supercomput"},{"key":"4396_CR58","unstructured":"Graph 500 (2021) http:\/\/graph500.org\/"},{"key":"4396_CR59","first-page":"45","volume":"19","author":"RC Murphy","year":"2010","unstructured":"Murphy RC, Wheeler KB, Barrett BW et al (2010) Introducing the graph 500. Cray Users Group (CUG) 19:45\u201374","journal-title":"Cray Users Group (CUG)"},{"key":"4396_CR60","unstructured":"NPB: NAS parallel benchmarks (2021) http:\/\/www.nas.nasa.gov\/publications\/npb.html"},{"issue":"3","key":"4396_CR61","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1177\/109434209100500306","volume":"5","author":"D Bailey","year":"1991","unstructured":"Bailey D, Barszcz E, Barton J et al (1991) The NAS parallel benchmarks. Int J Supercomput Appl 5(3):63\u201373. https:\/\/doi.org\/10.1177\/109434209100500306","journal-title":"Int J Supercomput Appl"},{"issue":"1","key":"4396_CR62","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1177\/1094342005051521","volume":"19","author":"R Thakur","year":"2005","unstructured":"Thakur R, Rabenseifner R, Gropp W (2005) Optimization of collective communication operations in MPICH. Int J High Perform Comput Appl 19(1):49\u201366. https:\/\/doi.org\/10.1177\/1094342005051521","journal-title":"Int J High Perform Comput Appl"},{"key":"4396_CR63","doi-asserted-by":"publisher","unstructured":"Deveci M, Kaya K, Ucar B (2015) Fast and high quality topology-aware task mapping. In: (2015) IEEE International Parallel and Distributed Processing Symposium. IEEE. https:\/\/doi.org\/10.1109\/ipdps.2015.93","DOI":"10.1109\/ipdps.2015.93"},{"key":"4396_CR64","doi-asserted-by":"publisher","unstructured":"Ma T, Bosilca G, Bouteiller A (2012) HierKNEM: an adaptive framework for kernel-assisted and topology-aware collective communications on many-core clusters. In: (2012) IEEE 26th International Parallel and Distributed Processing Symposium, IEEE. https:\/\/doi.org\/10.1109\/ipdps.2012.91","DOI":"10.1109\/ipdps.2012.91"},{"issue":"4","key":"4396_CR65","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/mc.2003.1193227","volume":"36","author":"W Wolf","year":"2003","unstructured":"Wolf W (2003) A decade of hardware\/ software codesign. Computer 36(4):38\u201343. https:\/\/doi.org\/10.1109\/mc.2003.1193227","journal-title":"Computer"},{"key":"4396_CR66","doi-asserted-by":"publisher","unstructured":"Teich J (2012) Hardware\/software codesign: the past, the present, and predicting the future. Proc IEEE 100(Special Centennial Issue):1411\u20131430. https:\/\/doi.org\/10.1109\/jproc.2011.2182009","DOI":"10.1109\/jproc.2011.2182009"},{"key":"4396_CR67","doi-asserted-by":"publisher","first-page":"160836","DOI":"10.1109\/access.2021.3131635","volume":"9","author":"OG Monakhov","year":"2021","unstructured":"Monakhov OG, Monakhova EA, Romanov AY et al (2021) Adaptive dynamic shortest path search algorithm in networks-on-chip based on circulant topologies. IEEE Access 9:160836\u2013160846. https:\/\/doi.org\/10.1109\/access.2021.3131635","journal-title":"IEEE Access"},{"key":"4396_CR68","doi-asserted-by":"publisher","unstructured":"Mirsadeghi SH, Afsahi A (2016) PTRAM: a parallel topology-and routing-aware mapping framework for large-scale HPC systems. In: (2016) IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE. https:\/\/doi.org\/10.1109\/ipdpsw.2016.146","DOI":"10.1109\/ipdpsw.2016.146"},{"key":"4396_CR69","doi-asserted-by":"publisher","unstructured":"Parsonage E, Nguyen HX, Bowden R et\u00a0al (2011) Generalized graph products for network design and analysis. In: 2011 19th IEEE International Conference on Network Protocols. IEEE, https:\/\/doi.org\/10.1109\/icnp.2011.6089084,","DOI":"10.1109\/icnp.2011.6089084"},{"key":"4396_CR70","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of product graphs","author":"RH Hammack","year":"2011","unstructured":"Hammack RH, Imrich W, Klav\u017ear S et al (2011) Handbook of product graphs, vol 2. CRC Press, Boca Raton"},{"issue":"6","key":"4396_CR71","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/12.53600","volume":"39","author":"S Dandamudi","year":"1990","unstructured":"Dandamudi S, Eager D (1990) Hierarchical interconnection networks for multicomputer systems. IEEE Trans Comput 39(6):786\u2013797. https:\/\/doi.org\/10.1109\/12.53600","journal-title":"IEEE Trans Comput"},{"key":"4396_CR72","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2011\/189434","volume":"2011","author":"M Abd-El-Barr","year":"2011","unstructured":"Abd-El-Barr M, Al-Somani TF (2011) Topological properties of hierarchical interconnection networks: a review and comparison. J Electr Comput Eng 2011:1\u201312. https:\/\/doi.org\/10.1155\/2011\/189434","journal-title":"J Electr Comput Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04396-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04396-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04396-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T14:12:01Z","timestamp":1656943921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04396-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":72,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4396"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04396-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"22 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}