{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:55Z","timestamp":1759638415350,"version":"3.40.5"},"reference-count":39,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902113"],"award-info":[{"award-number":["61902113"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872257"],"award-info":[{"award-number":["61872257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1905211"],"award-info":[{"award-number":["U1905211"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:p> The interconnetion network plays an important role in a parallel system. To avoid the edge number of the interconnect network scaling rapidly with the increase of dimension and achieve a good balance of hardware costs and properties, this paper presents a new interconnection network called exchanged [Formula: see text]-ary [Formula: see text]-cube ([Formula: see text]). Compared with the [Formula: see text]-ary [Formula: see text]-cube structures, [Formula: see text] shows better performance in terms of many metrics such as small degree and fewer links. In this paper, we first introduce the structure of [Formula: see text] and present some properties of [Formula: see text]; then, we propose a routing algorithm and obtain the diameter of [Formula: see text]. Finally, we analyze the diagnosis of [Formula: see text] and give the diagnosibility under PMC model and MM* model. <\/jats:p>","DOI":"10.1142\/s0129054121500131","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:13:45Z","timestamp":1610586825000},"page":"235-252","source":"Crossref","is-referenced-by-count":5,"title":["An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation"],"prefix":"10.1142","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2366-6027","authenticated-orcid":false,"given":"Yali","family":"Lv","sequence":"first","affiliation":[{"name":"School of Information Technology, Henan University of Chinese Medicine, Zhengzhou, China, 450046, China"}]},{"given":"Cheng-Kuan","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Science, Fuzhou University, Fuzhou, China, 350108, China"}]},{"given":"Guijuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Qilu University of Technology, Jiyuan, China, 250353, China"}]}],"member":"219","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"key":"S0129054121500131BIB001","doi-asserted-by":"publisher","DOI":"10.1147\/rd.492.0265"},{"key":"S0129054121500131BIB002","doi-asserted-by":"publisher","DOI":"10.1145\/509593.509632"},{"key":"S0129054121500131BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674658"},{"key":"S0129054121500131BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00197-Q"},{"key":"S0129054121500131BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/2.19830"},{"key":"S0129054121500131BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/12.403718"},{"key":"S0129054121500131BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.59"},{"key":"S0129054121500131BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.10"},{"key":"S0129054121500131BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676472"},{"key":"S0129054121500131BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/71.615436"},{"key":"S0129054121500131BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"issue":"3","key":"S0129054121500131BIB012","first-page":"47","volume":"13","author":"Friedman A. D.","year":"1980","journal-title":"The Computer Journal"},{"key":"S0129054121500131BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.030"},{"key":"S0129054121500131BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.18"},{"key":"S0129054121500131BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-007-0133-5"},{"key":"S0129054121500131BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1022"},{"key":"S0129054121500131BIB017","doi-asserted-by":"publisher","DOI":"10.1201\/9781420044829"},{"key":"S0129054121500131BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/71.205649"},{"key":"S0129054121500131BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/CMPCON.1993.289660"},{"key":"S0129054121500131BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.02.011"},{"key":"S0129054121500131BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.330"},{"key":"S0129054121500131BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2013.2285031"},{"key":"S0129054121500131BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.113"},{"key":"S0129054121500131BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.047"},{"issue":"12","key":"S0129054121500131BIB025","first-page":"159","volume":"60","author":"Lv Y.","year":"2017","journal-title":"The Computer Journal"},{"key":"S0129054121500131BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.06.007"},{"key":"S0129054121500131BIB027","first-page":"173","volume-title":"Proceedings of 11th International Symposium on Fault-Tolerant Computing","author":"Maeng J.","year":"1981"},{"key":"S0129054121500131BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675605"},{"key":"S0129054121500131BIB029","doi-asserted-by":"publisher","DOI":"10.1145\/287831.287838"},{"key":"S0129054121500131BIB030","doi-asserted-by":"publisher","DOI":"10.1145\/173682.165158"},{"key":"S0129054121500131BIB031","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264748"},{"key":"S0129054121500131BIB032","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3506"},{"key":"S0129054121500131BIB033","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"key":"S0129054121500131BIB034","doi-asserted-by":"publisher","DOI":"10.1109\/12.177309"},{"key":"S0129054121500131BIB035","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.03.011"},{"key":"S0129054121500131BIB036","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-017-0657-9"},{"volume-title":"Introduction to graph theory","year":"2001","author":"West D. B.","key":"S0129054121500131BIB037"},{"key":"S0129054121500131BIB038","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2318305"},{"key":"S0129054121500131BIB039","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.046"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054121500131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T11:14:58Z","timestamp":1618312498000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054121500131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":39,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10.1142\/S0129054121500131"],"URL":"https:\/\/doi.org\/10.1142\/s0129054121500131","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2021,1,13]]}}}