{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T00:40:14Z","timestamp":1701564014126},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,12,1]]},"DOI":"10.1587\/transinf.2023pap0004","type":"journal-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T22:36:03Z","timestamp":1701383763000},"page":"1979-1987","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Algorithm with Automatic Adjustment of the Number of Switches in the Order\/Radix Problem"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Masaki","family":"TSUKAMOTO","sequence":"first","affiliation":[{"name":"Graduate School, Kansai University"}]},{"given":"Yoshiko","family":"HANADA","sequence":"additional","affiliation":[{"name":"Kansai University"}]},{"given":"Masahiro","family":"NAKAO","sequence":"additional","affiliation":[{"name":"RIKEN Center for Computational Science"}]},{"given":"Keiji","family":"YAMAMOTO","sequence":"additional","affiliation":[{"name":"RIKEN Center for Computational Science"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Zhu, M. Taylor, S.B. Baden, and C.-K. Cheng, \u201cAdvancing supercomputer performance through interconnection topology synthesis,\u201d 2008 IEEE\/ACM International Conference on Computer-Aided Design, pp.555-558, 2008. 10.1109\/iccad.2008.4681630","DOI":"10.1109\/ICCAD.2008.4681630"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M. Ort\u00edn-Ob\u00f3n, D. Su\u00e1rez-Gracia, M. Villarroya-Gaud\u00f3, C. Izu, and V. Vi\u00f1als-Y\u00fafera, \u201cAnalysis of network-on-chip topologies for cost-efficient chip multiprocessors,\u201d Microprocessors and Microsystems, vol.42, pp.24-36, 2016. 10.1016\/j.micpro.2016.01.005","DOI":"10.1016\/j.micpro.2016.01.005"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S.A. Jyothi, A. Singla, P.B. Godfrey, and A. Kolla, \u201cMeasuring and understanding throughput of network topologies,\u201d SC '16: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp.761-772, 2016. 10.1109\/sc.2016.64","DOI":"10.1109\/SC.2016.64"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Y. Deng, M. Guo, A.F. Ramos, X. Huang, Z. Xu, and W. Liu, \u201cOptimal low-latency network topologies for cluster performance enhancement,\u201d The Journal of Supercomputing, vol.76, no.12, pp.9558-9584, 2020. 10.1007\/s11227-020-03216-y","DOI":"10.1007\/s11227-020-03216-y"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S. Tavara and A. Schliep, \u201cEffects of network topology on the performance of consensus and distributed learning of svms using admm,\u201d PeerJ Computer Science, vol.7, p.e397, 2021. 10.7717\/peerj-cs.397","DOI":"10.7717\/peerj-cs.397"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Koibuchi, H. Matsutani, H. Amano, D.F. Hsu, and H. Casanova, \u201cA case for random shortcut topologies for HPC interconnects,\u201d 2012 39th Annual International Symposium on Computer Architecture (ISCA), pp.177-188, June 2012. 10.1109\/isca.2012.6237016","DOI":"10.1109\/ISCA.2012.6237016"},{"key":"7","unstructured":"[7] A. Singla, C. Hong, L. Popa, and P.B. Godfrey, \u201cJellyfish: Networking Data Centers Randomly,\u201d CoRR, vol.abs\/1110.1687, 2011."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J.-Y. Shin, B. Wong, and E.G. Sirer, \u201cSmall-world Datacenters,\u201d Proc. 2nd ACM Symposium on Cloud Computing, SOCC '11, New York, NY, USA, pp.2:1-2:13, ACM, 2011. 10.1145\/2038916.2038918","DOI":"10.1145\/2038916.2038918"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] F. Chaix, I. Fujiwara, and M. Koibuchi, \u201cSuitability of the random topology for hpc applications,\u201d 2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), pp.301-304, Feb. 2016. 10.1109\/pdp.2016.10","DOI":"10.1109\/PDP.2016.10"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] M. Koibuchi, I. Fujiwara, K. Ishii, S. Namiki, F. Chaix, H.Matsutani, H. Amano, and T. Kudoh, \u201cOptical network technologies for HPC: computer-architects point of view,\u201d IEICE Electron. Express, vol.13, no.6, pp.1-14, 2016. 10.1587\/elex.13.20152007","DOI":"10.1587\/elex.13.20152007"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Nakao, M. Sakai, Y. Hanada, H. Murai, and M. Sato, \u201cGraph optimization algorithm for low-latency interconnection networks,\u201d Parallel Computing, vol.106, p.102805, 2021. 10.1016\/j.parco.2021.102805","DOI":"10.1016\/j.parco.2021.102805"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] T. Kitasuka, T. Matsuzaki, and M. Iida, \u201cOrder adjustment approach using cayley graphs for the order\/degree problem,\u201d IEICE Trans. Inf. & Syst., vol.E101-D, no.12, pp.2908-2915, 2018. 10.1587\/transinf.2018pap0008","DOI":"10.1587\/transinf.2018PAP0008"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Y. Ryota, K. Michihiro, N. Koji, M. Hiroki, and A. Hideharu,\u201cDesigning high-performance interconnection networks with host-switch graphs,\u201d IEEE Trans. Parallel Distrib. Syst., vol.30, no.2, pp.315-330, 2019. 10.1109\/tpds.2018.2864286","DOI":"10.1109\/TPDS.2018.2864286"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, \u201cEquation of state calculations by fast computing machines,\u201d The Journal of Chemical Physics, vol.21, no.6, pp.1087-1092, 1953. 10.1063\/1.1699114","DOI":"10.1063\/1.1699114"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, \u201cOptimization by simulated annealing,\u201d Science, vol.220, no.4598, pp.671-680, 1983. 10.1126\/science.220.4598.671","DOI":"10.1126\/science.220.4598.671"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] M. Nakao, M. Tsukamoto, Y. Hanada, and K. Yamamoto, \u201cGraph optimization algorithm using symmetry and host bias for low-latency indirect network,\u201d Parallel Computing, vol.114, p.102983, 2022. 10.1016\/j.parco.2022.102983","DOI":"10.1016\/j.parco.2022.102983"},{"key":"17","unstructured":"[17] \u201cGraph Golf: The Order\/degree Problem Competition.\u201d http:\/\/research.nii.ac.jp\/graphgolf (accessed 24 Jan. 2022)."},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] M. Miller and J. Sir\u00e1n, \u201cMoore graphs and beyond: A survey of the degree\/diameter problem,\u201d Electronic Journal of Combinatorics, Dynamic survey, vol.14, pp.1-61, Dec. 2005. 10.37236\/35","DOI":"10.37236\/35"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] B. Freisleben and P. Merz, \u201cNew genetic local search operators for the traveling salesman problem,\u201d Proc. Parallel Problem Solving fron Nature (PPSN) IV, vol.1141, pp.890-899, 1996. 10.1007\/3-540-61723-x_1052","DOI":"10.1007\/3-540-61723-X_1052"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Y. Nagata, \u201cNew eax crossover for large tsp instances,\u201d Proc. Parallel Problem Solving fron Nature (PPSN) IX, vol.4193, pp.372-381, 2006. 10.1007\/11844297_38","DOI":"10.1007\/11844297_38"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Y. Hanada, T. Hiroyasu, and M. Miki, \u201cGenetic multi-step search in interpolation and extrapolation domain,\u201d Proc. Genetic and Evolutionary Computation Conference (GECCO) 2007, pp.1242-1249, 2007. 10.1145\/1276958.1277197","DOI":"10.1145\/1276958.1277197"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/12\/E106.D_2023PAP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T04:18:58Z","timestamp":1701490738000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/12\/E106.D_2023PAP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":21,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2023pap0004","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"article-number":"2023PAP0004"}}