{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:56:06Z","timestamp":1773968166636,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T00:00:00Z","timestamp":1672012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T00:00:00Z","timestamp":1672012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 102-2911-I-006-301"],"award-info":[{"award-number":["MOST 102-2911-I-006-301"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 102-2911-I-006-301"],"award-info":[{"award-number":["MOST 102-2911-I-006-301"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 102-2911-I-006-301"],"award-info":[{"award-number":["MOST 102-2911-I-006-301"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 102-2911-I-006-301"],"award-info":[{"award-number":["MOST 102-2911-I-006-301"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-16-1-0499"],"award-info":[{"award-number":["FA9550-16-1-0499"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-16-1-0499"],"award-info":[{"award-number":["FA9550-16-1-0499"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-16-1-0499"],"award-info":[{"award-number":["FA9550-16-1-0499"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-16-1-0499"],"award-info":[{"award-number":["FA9550-16-1-0499"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-16-1-0499"],"award-info":[{"award-number":["FA9550-16-1-0499"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In modern computing architectures, graph theory is the soul of the play due to the rising core counts. It is indispensable to keep finding a better way to connect the cores. A novel chordal-ring interconnect topology system, Equality, is revisited in this paper to compare with a few previous works. This paper details the procedures for constructing the Equality interconnects, its special routing procedures, the strategies for selecting a configuration, and evaluating its performance using the open-source cycle-accurate BookSim package. Four scenarios representing small- to large-scale computing facilities are presented to assess the network performance. This work shows that in 16,384-endpoint systems, the Equality network turns out to be the most efficient system. The results also show the steady scalability of Equality networks extending to 48\u2013320K, and a million endpoints. Equality networks are adjustable to fit with commodity hardware and resilient under ten common traffic models. It is suggested that Equality network topology can be used in constructing efficient multi-exaflops supercomputers and data centers.<\/jats:p>","DOI":"10.1007\/s11227-022-05005-1","type":"journal-article","created":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T07:02:41Z","timestamp":1672038161000},"page":"8729-8753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Performance evaluation of multi-exaflops machines using Equality network topology"],"prefix":"10.1007","volume":"79","author":[{"given":"Chi-Hsiu","family":"Liang","sequence":"first","affiliation":[]},{"given":"Chun-Ho","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Hong-Lin","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Chao-Chin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Po-Lin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Chi-Chuan","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,26]]},"reference":[{"key":"5005_CR1","doi-asserted-by":"crossref","unstructured":"Yang CY, Liang CH, Wu HL, Cheng CH, Li CC, Chen CM, Huang PL, Hwang CC (2019) Exceeding the performance of two-tier fat-tree: equality network topology. Future of Information and Communication Conference, 14. Springer, Cham, pp 1187\u20131199","DOI":"10.1007\/978-3-030-12385-7_83"},{"key":"5005_CR2","doi-asserted-by":"crossref","unstructured":"Liang CH, Cheng CH, Wu HL, Li CC, Chen CM, Huang PL, Huang SL, Hwang CC. (2018) Beyond the performance of three-tier fat-tree: equality topology with low diameter. In 2018 international symposium on computer, consumer and control (IS3C) (pp. 22-29). IEEE","DOI":"10.1109\/IS3C.2018.00015"},{"key":"5005_CR3","doi-asserted-by":"crossref","unstructured":"Wu HL, Cheng CH, Liang CH, Li CC, Chen CM, Huang PL, Huang SL, Hwang CC. (2020) Beyond the performance of 3D-torus: equality topology with low radix. In 2020 international symposium on computer, consumer and control (IS3C) (pp. 319-322). IEEE","DOI":"10.1109\/IS3C50286.2020.00089"},{"key":"5005_CR4","doi-asserted-by":"crossref","unstructured":"Cheng CH, Wu HL, Liang CH, Li CC, Chen CM, Huang PL, Huang SL, Hwang CC. (2020) Equality NoC: a novel NoC topology for high performance and energy efficiency. In 2020 international symposium on computer, consumer and control (IS3C) (pp. 83-86). IEEE","DOI":"10.1109\/IS3C50286.2020.00029"},{"key":"5005_CR5","volume-title":"Princ Pract Interconnect Netw","author":"WJ Dally","year":"2004","unstructured":"Dally WJ, Towles BP (2004) Princ Pract Interconnect Netw. Elsevier"},{"issue":"3","key":"5005_CR6","first-page":"2075","volume":"410","author":"A Lutomirski","year":"2011","unstructured":"Lutomirski A, Tegmark M, Sanchez NJ, Stein LC, Urry WL, Zaldarriaga M (2011) Solving the corner-turning problem for large interferometers. Mon Not R Astron Soc 410(3):2075\u201380","journal-title":"Mon Not R Astron Soc"},{"issue":"3","key":"5005_CR7","first-page":"56","volume":"1","author":"A Daryin","year":"2015","unstructured":"Daryin A, Korzh A (2015) Early evaluation of direct large-scale InfiniBand networks with adaptive routing. Supercomput Front Innov 1(3):56\u201369","journal-title":"Supercomput Front Innov"},{"issue":"13","key":"5005_CR8","first-page":"89","volume":"15","author":"JJ Dongarra","year":"1997","unstructured":"Dongarra JJ, Meuer HW, Strohmaier E (1997) TOP500 supercomputer sites. Supercomputer 15(13):89\u2013111","journal-title":"Supercomputer"},{"key":"5005_CR9","doi-asserted-by":"crossref","unstructured":"Jiang N, Balfour J, Becker DU, Towles B, Dally WJ, Michelogiannakis G, Kim J. (2013) A detailed and flexible cycle-accurate network-on-chip simulator. In performance analysis of systems and software (ISPASS), 2013 IEEE international symposium on (pp. 86-96). IEEE","DOI":"10.1109\/ISPASS.2013.6557149"},{"key":"5005_CR10","doi-asserted-by":"crossref","unstructured":"Beivide R, Mart\u00ednez C, Izu C, Gutierrez J, Gregorio J\u00c1, Miguel-Alonso J (2003) Chordal topologies for interconnection networks. International symposium on high performance computing, 20. Springer, Berlin, pp 385\u2013392","DOI":"10.1007\/978-3-540-39707-6_33"},{"key":"5005_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S0219265908002187","volume":"9","author":"B Parhami","year":"2008","unstructured":"Parhami B (2008) Periodically regular chordal rings are preferable to double-ring networks. J Interconnect Netw 9:99\u2013126","journal-title":"J Interconnect Netw"},{"key":"5005_CR12","doi-asserted-by":"crossref","unstructured":"Dubalski B, Bujnowski S, Ledzinski D, Zabludowski A, Kiedrowski P. (2012) Analysis of modified fifth degree chordal rings. In New Frontiers in Graph Theory. InTech","DOI":"10.5772\/35598"},{"issue":"9","key":"5005_CR13","first-page":"1987","volume":"11","author":"RN Faraha","year":"2016","unstructured":"Faraha RN, Chienb SLE, Othmanca M (2016) Graph theoretical properties of degree six 3-modifiled chordal ring networks. J Eng Appl Sci 11(9):1987\u20131999","journal-title":"J Eng Appl Sci"},{"key":"5005_CR14","doi-asserted-by":"crossref","unstructured":"Parhami B. (1995) Periodically regular chordal ring networks for massively parallel architectures. In frontiers of massively parallel computation, Proceedings. Frontiers\u2019 95., fifth symposium on the (1995) pp. 315-322, IEEE","DOI":"10.1109\/FMPC.1995.380439"},{"issue":"3","key":"5005_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.2478\/v10248-012-0020-4","volume":"17","author":"\u0141 Zab\u0142udowski","year":"2012","unstructured":"Zab\u0142udowski \u0141, Dubalski B, Kiedrowski P, Ledzi\u0144ski D, Marciniak T (2012) Modified NDR structures. Image Process Commun 17(3):29\u201345","journal-title":"Image Process Commun"},{"key":"5005_CR16","unstructured":"Singh A. (2005) Load-balanced routing in interconnection networks (Doctoral dissertation, Stanford University)"},{"key":"5005_CR17","doi-asserted-by":"crossref","unstructured":"Besta M, Hoefler T. (2014) Slim Fly: A cost effective low-diameter network topology. In High Performance Computing, Networking, Storage and Analysis, SC14: International Conference (pp. 348-359). IEEE","DOI":"10.1109\/SC.2014.34"},{"issue":"10","key":"5005_CR18","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1109\/71.473515","volume":"6","author":"J Duato","year":"1995","unstructured":"Duato J (1995) A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Trans Parallel Distrib Syst 6(10):1055\u201367","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5005_CR19","doi-asserted-by":"crossref","unstructured":"Dally WJ, Seitz CL. (1988) Deadlock-free message routing in multiprocessor interconnection networks. California Institute of Technology. (Unpublished)","DOI":"10.1109\/TC.1987.1676939"},{"key":"5005_CR20","volume-title":"Interconnection networks: an engineering approach","author":"J Duato","year":"2003","unstructured":"Duato J, Yalamanchili S, Ni LM (2003) Interconnection networks: an engineering approach. Morgan Kaufmann"},{"key":"5005_CR21","unstructured":"Gopal IS. (1994) Interconnection networks for High-performance parallel computers. chapter Prevention of Store-and-forward Deadlock in computer networks., p. 338-344. IEEE computer society press, Los Alamitos, CA"},{"key":"5005_CR22","doi-asserted-by":"crossref","unstructured":"Kim J, Balfour J, Dally W. (2007) Flattened butterfly topology for on-chip networks. In microarchitecture. MICRO 2007. 40th annual IEEE\/ACM international symposium on 2007 (pp. 172-182). IEEE","DOI":"10.1109\/MICRO.2007.29"},{"issue":"3","key":"5005_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1394608.1382129","volume":"36","author":"J Kim","year":"2008","unstructured":"Kim J, Dally WJ, Scott S, Abts D (2008) Technology-driven, highly-scalable dragonfly topology. ACM SIGARCH Comput Archit News. IEEE Comput Soc 36(3):77\u201388","journal-title":"ACM SIGARCH Comput Archit News. IEEE Comput Soc"},{"key":"5005_CR24","doi-asserted-by":"crossref","unstructured":"Kathareios\u00a0G, Minkenberg\u00a0C, Prisacari\u00a0B, Rodriguez\u00a0G, Hoefler\u00a0T. (2015) Cost-effective diameter-two topologies: analysis and evaluation. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (p. 36). ACM","DOI":"10.1145\/2807591.2807652"},{"key":"5005_CR25","doi-asserted-by":"crossref","unstructured":"Mubarak M, Carothers CD, Ross R, Carns P. (2012) Modeling a million-node dragonfly network using massively parallel discrete-event simulation. In high performance computing, networking, storage and analysis (SCC), 2012 SC Companion (pp. 366-376). IEEE","DOI":"10.1109\/SC.Companion.2012.56"},{"key":"5005_CR26","doi-asserted-by":"crossref","unstructured":"Kim J, Dally WJ, Abts D. (2007) Flattened butterfly: a cost-efficient topology for high-radix networks. In ACM SIGARCH Computer Architecture News (pp. 126-137). ACM","DOI":"10.1145\/1273440.1250679"},{"key":"5005_CR27","doi-asserted-by":"crossref","unstructured":"Wolfe N, Carothers CD, Mubarak M, Ross R, Carns P. (2016) Modeling a million-node slim fly network using parallel discrete-event simulation. In Proceedings of the 2016 annual ACM Conference on SIGSIM Principles of Advanced Discrete Simulation (pp. 189-199). ACM","DOI":"10.1145\/2901378.2901389"},{"key":"5005_CR28","doi-asserted-by":"crossref","unstructured":"Alistarh D, Ballani H, Costa P, Funnell A, Benjamin J, Watts P, Thomsen B. (2015) A high-radix, low-latency optical switch for data centers. In ACM SIGCOMM computer communication review (pp. 367-368). ACM","DOI":"10.1145\/2829988.2790035"},{"key":"5005_CR29","doi-asserted-by":"crossref","unstructured":"Domke J, Hoefler T, Matsuoka S. (2016) Routing on the dependency graph: a new approach to deadlock-free high-performance routing. In proceedings of the 25th ACM international symposium on high-performance parallel and distributed computing (pp. 3-14)","DOI":"10.1145\/2907294.2907313"},{"issue":"21","key":"5005_CR30","first-page":"22","volume":"20","author":"N Jain","year":"2016","unstructured":"Jain N, Bhatele A, White S, Gamblin T, Kale LV (2016) Evaluating HPC networks via simulation of parallel workloads. Framework 20(21):22","journal-title":"Framework"},{"key":"5005_CR31","doi-asserted-by":"crossref","unstructured":"Yang X, Jenkins J, Mubarak M, Ross RB, Lan Z. (2016) Watch out for the bully!: job interference study on dragonfly network. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (p. 64). IEEE Press","DOI":"10.1109\/SC.2016.63"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-05005-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-05005-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-05005-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:09:21Z","timestamp":1728605361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-05005-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,26]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["5005"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-05005-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,26]]},"assertion":[{"value":"4 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}