{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:20:26Z","timestamp":1775067626128,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014103","name":"Key Technology Research and Development Program of Shandong","doi-asserted-by":"publisher","award":["2015GGX101028"],"award-info":[{"award-number":["2015GGX101028"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11674264"],"award-info":[{"award-number":["11674264"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science Foundation for Youths of Shandong Academy of Sciences of China","award":["2014QN010"],"award-info":[{"award-number":["2014QN010"]}]},{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"crossref","award":["88881.062174\/2014-0"],"award-info":[{"award-number":["88881.062174\/2014-0"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2016YFB0200604"],"award-info":[{"award-number":["2016YFB0200604"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Special Fund for Overseas High-level Talents of Shandong Province of China"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11227-020-03216-y","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T18:09:44Z","timestamp":1583172584000},"page":"9558-9584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Optimal low-latency network topologies for cluster performance enhancement"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5224-3958","authenticated-orcid":false,"given":"Yuefan","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1180-8104","authenticated-orcid":false,"given":"Meng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4681-3069","authenticated-orcid":false,"given":"Alexandre F.","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1174-7148","authenticated-orcid":false,"given":"Xiaolong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7460-8981","authenticated-orcid":false,"given":"Zhipeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2801-7862","authenticated-orcid":false,"given":"Weifeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,2]]},"reference":[{"key":"3216_CR1","unstructured":"(2019) Effective bandwidth (b_eff) benchmark. https:\/\/fs.hlrs.de\/projects\/par\/mpi\/b_eff\/"},{"key":"3216_CR2","unstructured":"(2019) FFTE: a fast Fourier transform package. http:\/\/www.ffte.jp\/"},{"key":"3216_CR3","unstructured":"(2019) Graph 500. http:\/\/graph500.org\/"},{"key":"3216_CR4","unstructured":"(2019) HPC challenge benchmark. http:\/\/icl.utk.edu\/hpcc\/index.html"},{"key":"3216_CR5","unstructured":"(2019) NPB: NAS parallel benchmarks. http:\/\/www.nas.nasa.gov\/publications\/npb.html"},{"key":"3216_CR6","unstructured":"(2019) Top 500 supercomputer site (2019). http:\/\/www.top500.org"},{"key":"3216_CR7","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"},{"issue":"2\u20133","key":"3216_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"NR Adiga","year":"2005","unstructured":"Adiga NR, Blumrich MA, Chen D, Coteus P, Gara A, Giampapa ME, Heidelberger P, Singh S, Steinmacher-Burow BD, Takken T, Tsao M, Vranas P (2005) Blue Gene\/L torus interconnection network. IBM J Res Dev 49(2\u20133):265\u2013276. https:\/\/doi.org\/10.1147\/rd.492.0265","journal-title":"IBM J Res Dev"},{"issue":"11","key":"3216_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":"3216_CR10","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. https:\/\/doi.org\/10.1109\/hoti.2010.23","DOI":"10.1109\/hoti.2010.23"},{"key":"3216_CR11","doi-asserted-by":"publisher","unstructured":"Ardagna D, Barbierato E, Evangelinou A, Gianniti E, Gribaudo M, Pinto TB, Guimar\u00e3es A, Couto\u00a0da Silva AP, Almeida JM (2018) Performance prediction of cloud-based big data applications. In: Proceedings of the 2018 ACM\/SPEC International Conference on Performance Engineering\u2014ICPE\u201918. ACM Press, pp 192\u2013199. https:\/\/doi.org\/10.1145\/3184407.3184420","DOI":"10.1145\/3184407.3184420"},{"issue":"3","key":"3216_CR12","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, Browning D, Carter R, Dagum L, Fatoohi R, Frederickson P, Lasinski T, Schreiber R, Simon H, Venkatakrishnan V, Weeratunga S (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"},{"key":"3216_CR13","doi-asserted-by":"publisher","unstructured":"Bailey D, Barszcz E, Dagum L, Simon H (1992) NAS parallel benchmark results. In: Proceedings Supercomputing \u201992. IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/superc.1992.236665","DOI":"10.1109\/superc.1992.236665"},{"issue":"1","key":"3216_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2008.04.018","volume":"157","author":"L Barriere","year":"2009","unstructured":"Barriere L, Comellas F, Dalf\u00f3 C, Fiol MA (2009) The hierarchical product of graphs. Discrete Appl Math 157(1):36\u201348. https:\/\/doi.org\/10.1016\/j.dam.2008.04.018","journal-title":"Discrete Appl Math"},{"issue":"12","key":"3216_CR15","doi-asserted-by":"publisher","first-page":"3871","DOI":"10.1016\/j.disc.2008.10.028","volume":"309","author":"L Barri\u00e8re","year":"2009","unstructured":"Barri\u00e8re L, Dalf\u00f3 C, Fiol MA, Mitjana M (2009) The generalized hierarchical product of graphs. Discrete Math 309(12):3871\u20133881. https:\/\/doi.org\/10.1016\/j.disc.2008.10.028","journal-title":"Discrete Math"},{"key":"3216_CR16","doi-asserted-by":"publisher","unstructured":"Besta M, Hoefler T (2014) Slim fly: a cost effective low-diameter network topology. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC\u201914. IEEE Press, Piscataway, NJ, USA, pp 348\u2013359. https:\/\/doi.org\/10.1109\/SC.2014.34","DOI":"10.1109\/SC.2014.34"},{"key":"3216_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty U (1976) Graph theory with applications. Elsevier, Amsterdam"},{"issue":"3","key":"3216_CR18","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, Hudson T (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":"2","key":"3216_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/jgt.22125","volume":"86","author":"G Brinkmann","year":"2017","unstructured":"Brinkmann G, Goedgebeur J (2017) Generation of cubic graphs and snarks with large girth. J Graph Theory 86(2):255\u2013272. https:\/\/doi.org\/10.1002\/jgt.22125","journal-title":"J Graph Theory"},{"issue":"2","key":"3216_CR20","first-page":"69","volume":"13","author":"G Brinkmann","year":"2011","unstructured":"Brinkmann G, Goedgebeur J, McKay BD (2011) Generation of cubic graphs. Discrete Math Theor Comput Sci 13(2):69\u201379","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"1\u20132","key":"3216_CR21","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.dam.2012.07.018","volume":"161","author":"G Brinkmann","year":"2013","unstructured":"Brinkmann G, Coolsaet K, Goedgebeur J, M\u00e9lot H (2013) House of graphs: a database of interesting graphs. Discrete Appl Math 161(1\u20132):311\u2013314. https:\/\/doi.org\/10.1016\/j.dam.2012.07.018","journal-title":"Discrete Appl Math"},{"issue":"10","key":"3216_CR22","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, Quinson M, Suter F (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"},{"issue":"4","key":"3216_CR23","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, Stanton RG (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"},{"key":"3216_CR24","doi-asserted-by":"publisher","unstructured":"Cerf VG, Cowan DD, Mullin RC, Stanton RG (1975) A partial census of trivalent generalized Moore networks. In: Combinatorial Mathematics III. Springer, Berlin, pp 1\u201327. https:\/\/doi.org\/10.1007\/bfb0069540","DOI":"10.1007\/bfb0069540"},{"key":"3216_CR25","doi-asserted-by":"publisher","unstructured":"Chen D, Parker JJ, Eisley NA, Heidelberger P, Senger RM, Sugawara Y, Kumar S, Salapura V, Satterfield DL, Steinmacher-Burow B (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\u2014SC\u201911. ACM Press. https:\/\/doi.org\/10.1145\/2063384.2063419","DOI":"10.1145\/2063384.2063419"},{"issue":"6","key":"3216_CR26","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"},{"issue":"9","key":"3216_CR27","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1109\/12.83652","volume":"40","author":"W Dally","year":"1991","unstructured":"Dally W (1991) Express cubes: improving the performance of k-ary n-cube interconnection networks. IEEE Trans Comput 40(9):1016\u20131023. https:\/\/doi.org\/10.1109\/12.83652","journal-title":"IEEE Trans Comput"},{"key":"3216_CR28","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, Amsterdam"},{"issue":"2","key":"3216_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/71.577251","volume":"8","author":"K Day","year":"1997","unstructured":"Day K, Al-Ayyoub AE (1997) The cross product of interconnection networks. IEEE Trans Parallel Distrib Syst 8(2):109\u2013118. https:\/\/doi.org\/10.1109\/71.577251","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"31","key":"3216_CR30","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":"3216_CR31","doi-asserted-by":"publisher","unstructured":"Domke J, Matsuoka S, Ivanov IR, Tsushima Y, Yuki T, Nomura A, Miura S, McDonald N, Floyd DL, Dub\u00e9 N (2019) HyperX topology: first at-scale implementation and comparison to the fat-tree. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM https:\/\/doi.org\/10.1145\/3295500.3356140","DOI":"10.1145\/3295500.3356140"},{"issue":"11","key":"3216_CR32","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/12.102840","volume":"40","author":"K Efe","year":"1991","unstructured":"Efe K (1991) A variation on the hypercube with lower diameter. IEEE Trans Comput 40(11):1312\u20131316. https:\/\/doi.org\/10.1109\/12.102840","journal-title":"IEEE Trans Comput"},{"key":"3216_CR33","doi-asserted-by":"publisher","unstructured":"Faanes G, Bataineh A, Roweth D, Court T, Froese E, Alverson B, Johnson T, Kopnick J, Higgins M, Reinhard J (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. https:\/\/doi.org\/10.1109\/sc.2012.39","DOI":"10.1109\/sc.2012.39"},{"issue":"6","key":"3216_CR34","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345. https:\/\/doi.org\/10.1145\/367766.368168","journal-title":"Commun ACM"},{"key":"3216_CR35","doi-asserted-by":"publisher","unstructured":"Foroutan S, Thonnart Y, Hersemeule R, Jerraya A (2010) An analytical method for evaluating network-on-chip performance. In: 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010). IEEE, pp 1629\u20131632. https:\/\/doi.org\/10.1109\/date.2010.5457072","DOI":"10.1109\/date.2010.5457072"},{"key":"3216_CR36","volume-title":"Statistical methods","author":"R Freund","year":"2010","unstructured":"Freund R, Wilson W, Mohr D (2010) Statistical methods, 3rd edn. Academic Press, Cambridge","edition":"3"},{"key":"3216_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-5588-7","author":"H Fu","year":"2016","unstructured":"Fu H, Liao J, Yang J, Wang L, Song Z, Huang X, Yang C, Xue W, Liu F, Qiao F, Zhao W, Yin X, Hou C, Zhang C, Ge W, Zhang J, Wang Y, Zhou C, Yang G (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"},{"key":"3216_CR38","doi-asserted-by":"publisher","unstructured":"Garz\u00f3n DB, G\u00f3mez C, G\u00f3mez ME, L\u00f3pez P, Duato J (2012) Towards an efficient fat\u2013tree like topology. In: Euro-Par 2012 Parallel Processing. Springer, Berlin, pp 716\u2013728. https:\/\/doi.org\/10.1007\/978-3-642-32820-6_71","DOI":"10.1007\/978-3-642-32820-6_71"},{"issue":"1","key":"3216_CR39","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/l-ca.2006.8","volume":"5","author":"AK Gupta","year":"2006","unstructured":"Gupta AK, Dally WJ (2006) Topology optimization of interconnection networks. IEEE Comput Archit Lett 5(1):10\u201313. https:\/\/doi.org\/10.1109\/l-ca.2006.8","journal-title":"IEEE Comput Archit Lett"},{"issue":"4","key":"3216_CR40","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","volume":"15","author":"F Harary","year":"1988","unstructured":"Harary F, Hayes JP, Wu HJ (1988) A survey of the theory of hypercube graphs. Comput Math Appl 15(4):277\u2013289. https:\/\/doi.org\/10.1016\/0898-1221(88)90213-1","journal-title":"Comput Math Appl"},{"key":"3216_CR41","unstructured":"Harwood A, Shen H (1998) A low cost hybrid fat-tree interconnection network. In: Proceedings of International Conference on Parallel and Distributed Processing and Applications, pp 682\u2013689"},{"issue":"12","key":"3216_CR42","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"},{"key":"3216_CR43","volume-title":"Readings in computer architecture","author":"MD Hill","year":"1999","unstructured":"Hill MD, Jouppi NP, Sohi GS (1999) Readings in computer architecture. Morgan Kaufmann, Burlington"},{"issue":"1\u20132","key":"3216_CR44","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\u20132):199\u2013220. https:\/\/doi.org\/10.1147\/rd.521.0199","journal-title":"IBM J Res Dev"},{"key":"3216_CR45","unstructured":"InfiniBand$$@$$ Trade Association (2016) InfiniBand architecture specification, release 1.3. http:\/\/www.infinibandtaorg"},{"key":"3216_CR46","doi-asserted-by":"publisher","unstructured":"Inoguchi Y, Horiguchi S (1997) Shifted recursive torus interconnection for high performance computing. In: Proceedings High Performance Computing on the Information Superhighway. HPC Asia\u201997. IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/hpc.1997.592123","DOI":"10.1109\/hpc.1997.592123"},{"key":"3216_CR47","first-page":"1213","volume":"20","author":"GE Jan","year":"2004","unstructured":"Jan GE, Hwang Y, Lin M, Liang D (2004) Novel hierarchical interconnection networks for high-performance multicomputer systems. J Inf Sci Eng 20:1213\u20131229","journal-title":"J Inf Sci Eng"},{"key":"3216_CR48","doi-asserted-by":"publisher","unstructured":"Kim J, Dally WJ, Scott S, Abts D (2008) Technology-driven, highly-scalable dragonfly topology. In: 2008 International Symposium on Computer Architecture. IEEE. https:\/\/doi.org\/10.1109\/isca.2008.19","DOI":"10.1109\/isca.2008.19"},{"key":"3216_CR49","doi-asserted-by":"publisher","unstructured":"Kitasuka T, Iida M (2016) A heuristic method of generating diameter 3 graphs for order\/degree problem (invited paper). In: 2016 Tenth IEEE\/ACM International Symposium on Networks-on-Chip (NOCS). IEEE. https:\/\/doi.org\/10.1109\/nocs.2016.7579334","DOI":"10.1109\/nocs.2016.7579334"},{"key":"3216_CR50","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 Computer Society Press. https:\/\/doi.org\/10.1109\/ipdps.2001.925208","DOI":"10.1109\/ipdps.2001.925208"},{"issue":"10","key":"3216_CR51","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/tc.1985.6312192","volume":"C\u201334","author":"CE Leiserson","year":"1985","unstructured":"Leiserson CE (1985) Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans Comput C\u201334(10):892\u2013901. https:\/\/doi.org\/10.1109\/tc.1985.6312192","journal-title":"IEEE Trans Comput"},{"key":"3216_CR52","unstructured":"Lenzen C, Wattenhofer R (2016) Clex: yet another supercomputer architecture? arXiv:1607.00298v1"},{"issue":"2","key":"3216_CR53","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11390-015-1520-7","volume":"30","author":"XK Liao","year":"2015","unstructured":"Liao XK, Pang ZB, Wang KF, Lu YT, Xie M, Xia J, Dong DZ, Suo G (2015) High performance interconnect network for Tianhe system. J Comput Sci Technol 30(2):259\u2013272. https:\/\/doi.org\/10.1007\/s11390-015-1520-7","journal-title":"J Comput Sci Technol"},{"key":"3216_CR54","unstructured":"Liu V, Halperin D, Krishnamurthy A, Anderson T (2013) F10: a fault-tolerant engineered network. In: Presented as Part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13). USENIX, Lombard, IL, pp 399\u2013412"},{"key":"3216_CR55","doi-asserted-by":"publisher","unstructured":"Liu YJ, Gao PX, Wong B, Keshav S (2014) Quartz: a new design element for low-latency DCNs. In: Proceedings of the 2014 ACM Conference on SIGCOMM\u2014SIGCOMM\u201914. ACM Press. https:\/\/doi.org\/10.1145\/2619239.2626332","DOI":"10.1145\/2619239.2626332"},{"key":"3216_CR56","doi-asserted-by":"publisher","unstructured":"Luszczek PR, Bailey DH, Dongarra JJ, Kepner J, Lucas RF, Rabenseifner R, Takahashi D (2006) S12\u2014the HPC challenge (HPCC) benchmark suite. In: Proceedings of the 2006 ACM\/IEEE Conference on Supercomputing\u2014SC\u201906. ACM Press. https:\/\/doi.org\/10.1145\/1188455.1188677","DOI":"10.1145\/1188455.1188677"},{"key":"3216_CR57","doi-asserted-by":"publisher","unstructured":"Matsutani H, Koibuchi M, Amano H, Yoshinaga T (2009) Prediction router: yet another low latency on-chip router architecture. In: 2009 IEEE 15th International Symposium on High Performance Computer Architecture. IEEE, pp 367\u2013378. https:\/\/doi.org\/10.1109\/hpca.2009.4798274","DOI":"10.1109\/hpca.2009.4798274"},{"issue":"2","key":"3216_CR58","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","volume":"30","author":"M Meringer","year":"1999","unstructured":"Meringer M (1999) Fast generation of regular graphs and construction of cages. J Graph Theory 30(2):137\u2013146. https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","journal-title":"J Graph Theory"},{"key":"3216_CR59","doi-asserted-by":"publisher","unstructured":"Mizuno R, Ishida Y (2016) Constructing large-scale low-latency network from small optimal networks. In: 2016 Tenth IEEE\/ACM International Symposium on Networks-on-Chip (NOCS). IEEE. https:\/\/doi.org\/10.1109\/nocs.2016.7579336","DOI":"10.1109\/nocs.2016.7579336"},{"issue":"8","key":"3216_CR60","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"},{"key":"3216_CR61","first-page":"45","volume":"19","author":"RC Murphy","year":"2010","unstructured":"Murphy RC, Wheeler KB, Barrett BW, Ang JA (2010) Introducing the graph 500. Cray Users Group (CUG) 19:45\u201374","journal-title":"Cray Users Group (CUG)"},{"key":"3216_CR62","doi-asserted-by":"publisher","unstructured":"Nakao M, Murai H, Sato M (2019) A method for order\/degree problem based on graph symmetry and simulated annealing with MPI\/OpenMP parallelization. In: Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region. ACM Press, pp 128\u2013137. https:\/\/doi.org\/10.1145\/3293320.3293325","DOI":"10.1145\/3293320.3293325"},{"issue":"02","key":"3216_CR63","doi-asserted-by":"publisher","first-page":"1540006","DOI":"10.1142\/s021812661540006x","volume":"24","author":"MMH Rahman","year":"2015","unstructured":"Rahman MMH, Nor RM, Sembok TMBT, Akhand MAH (2015) Architecture and network-on-chip implementation of a new hierarchical interconnection network. J Circuits Syst Comput 24(02):1540006. https:\/\/doi.org\/10.1142\/s021812661540006x","journal-title":"J Circuits Syst Comput"},{"issue":"07","key":"3216_CR64","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, Ramos AF (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"},{"key":"3216_CR65","doi-asserted-by":"publisher","unstructured":"Sanders P, Schulz C (2013) Think locally, act globally: highly balanced graph partitioning. In: Experimental Algorithms. Springer, Berlin, pp 164\u2013175. https:\/\/doi.org\/10.1007\/978-3-642-38527-8_16","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"3216_CR66","unstructured":"Scott SL et\u00a0al (1996) The Cray T3E network: adaptive routing in a high performance 3D torus"},{"issue":"4","key":"3216_CR67","doi-asserted-by":"publisher","first-page":"1636","DOI":"10.1007\/s11227-017-2186-4","volume":"74","author":"JH Seo","year":"2017","unstructured":"Seo JH, Kim JS, Chang HJ, Lee HO (2017) The hierarchical Petersen network: a new interconnection network with fixed degree. J Supercomput 74(4):1636\u20131654. https:\/\/doi.org\/10.1007\/s11227-017-2186-4","journal-title":"J Supercomput"},{"key":"3216_CR68","doi-asserted-by":"publisher","unstructured":"Shimizu N, Mori R (2016) Average shortest path length of graphs of diameter 3. In: 2016 Tenth IEEE\/ACM International Symposium on Networks-on-Chip (NOCS). IEEE. https:\/\/doi.org\/10.1109\/nocs.2016.7579335","DOI":"10.1109\/nocs.2016.7579335"},{"key":"3216_CR69","doi-asserted-by":"publisher","unstructured":"Takahashi D (2002) A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers. In: Lecture Notes in Computer Science. Springer, Berlin, pp 380\u2013389. https:\/\/doi.org\/10.1007\/3-540-48051-x_38","DOI":"10.1007\/3-540-48051-x_38"},{"issue":"2","key":"3216_CR70","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":"3216_CR71","doi-asserted-by":"publisher","unstructured":"Wang S, Li D, Geng J, Gu Y, Cheng Y (2019) Impact of network topology on the performance of DML: theoretical analysis and practical factors. In: IEEE INFOCOM 2019\u2014IEEE Conference on Computer Communications. IEEE, pp 1729\u20131737. https:\/\/doi.org\/10.1109\/infocom.2019.8737595","DOI":"10.1109\/infocom.2019.8737595"},{"key":"3216_CR72","unstructured":"Weisstein EW (2018) Bidiakis Cube. http:\/\/mathworld.wolfram.com\/BidiakisCube.html"},{"key":"3216_CR73","volume-title":"Topological structure and analysis of interconnection networks","author":"J Xu","year":"2013","unstructured":"Xu J (2013) Topological structure and analysis of interconnection networks, vol 7. Springer, Berlin"},{"issue":"12","key":"3216_CR74","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, Deng Y (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":"7","key":"3216_CR75","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/71.940745","volume":"12","author":"Y Yang","year":"2001","unstructured":"Yang Y, Funahashi A, Jouraku A, Nishi H, Amano H, Sueyoshi T (2001) Recursive diagonal torus: an interconnection network for massively parallel computers. IEEE Trans Parallel Distrib Syst 12(7):701\u2013715. https:\/\/doi.org\/10.1109\/71.940745","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"3216_CR76","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":"4","key":"3216_CR77","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, Luo X, Wu J (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"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03216-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03216-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03216-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:56:55Z","timestamp":1614646615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03216-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,2]]},"references-count":77,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3216"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03216-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,2]]},"assertion":[{"value":"2 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}