{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:25Z","timestamp":1750824685852,"version":"3.41.0"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7477","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T22:19:31Z","timestamp":1501539571000},"page":"1798-1806","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Ryuta","family":"KAWANO","sequence":"first","affiliation":[{"name":"Dept. of ICS, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"NAKAHARA","sequence":"additional","affiliation":[{"name":"Dept. of ICS, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seiichi","family":"TADE","sequence":"additional","affiliation":[{"name":"Dept. of ICS, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ikki","family":"FUJIWARA","sequence":"additional","affiliation":[{"name":"Universal Communication Research Institute, National Institute of Information and Communications Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"MATSUTANI","sequence":"additional","affiliation":[{"name":"Dept. of ICS, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michihiro","family":"KOIBUCHI","sequence":"additional","affiliation":[{"name":"National Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideharu","family":"AMANO","sequence":"additional","affiliation":[{"name":"Dept. of ICS, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] K. Scott Hemmert et al, \u201cReport on Institute for Advanced Architectures and Algorithms,\u201d Interconnection Networks Workshop 2008, http:\/\/ft.ornl.gov\/doku\/_media\/iaaicw\/iaa-ic-2008-workshop-report-v09.pdf"},{"key":"2","unstructured":"[2] J. Tomkins, \u201cInterconnects: A Buyers Point of View,\u201d ACS Workshop, June 2007."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J.Y. Shin, B. Wong, and E.G. Sirer, \u201cSmall-World Datacenters,\u201d Proc. Symposium on Cloud Computing (SoCC), pp.2:1-2:13, Oct. 2011. 10.1145\/2038916.2038918","DOI":"10.1145\/2038916.2038918"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. Koibuchi, H. Matsutani, H. Amano, D.F. Hsu, and H. Casanova, \u201cA Case for Random Shortcut Topologies for HPC Interconnects,\u201d Proc. International Symposium on Computer Architecture (ISCA), pp.177-188, June 2012. 10.1109\/isca.2012.6237016","DOI":"10.1145\/2366231.2337179"},{"key":"5","unstructured":"[5] A. Singla, C.Y. Hong, L. Popa, and P.B. Godfrey, \u201cJellyfish: Networking Data Centers Randomly,\u201d Proc. USENIX Symposium on Network Design and Implementation (NSDI), pp.225-238, April 2012."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T. Skeie, O. Lysne, and I. Theiss, \u201cLayered Shortest Path (LASH) Routing in Irregular System Area Networks,\u201d Proc. IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2001. 10.1109\/ipdps.2002.1016559","DOI":"10.1109\/IPDPS.2002.1016559"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Skeie, O. Lysne, J. Flich, P. Lopez, A. Robles, and J. Duato, \u201cLASH-TOR: A Generic Transition-Oriented Routing Algorithm,\u201d Proc. 10th International Conference on Parallel and Distributed Systems (ICPADS), pp.595-604, July 2004. 10.1109\/icpads.2004.1316144","DOI":"10.1109\/ICPADS.2004.1316144"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] R. Kawano, H. Nakahara, S. Tade, I. Fujiwara, H. Matsutani, M. Koibuchi, and H. Amano, \u201cACRO: Assignment of Channels in Reverse Order to Make Arbitrary Routing Deadlock-free,\u201d Proc. 15th IEEE\/ACIS International Conference on Computer and Information Science (ICIS), pp.565-570, June 2016. 10.1109\/icis.2016.7550818","DOI":"10.1109\/ICIS.2016.7550818"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J. Kim, W.J. Dally, and D. Abts, \u201cFlattened Butterfly: a Cost-Efficient Topology for High-Radix Networks,\u201d Proc. International Symposium on Computer Architecture (ISCA), pp.126-137, June 2007. 10.1145\/1250662.1250679","DOI":"10.1145\/1273440.1250679"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. Kim, W.J. Dally, S. Scott, and D. Abts, \u201cTechnology-Driven, Highly-Scalable Dragonfly Topology,\u201d Proc. International Symposium on Computer Architecture (ISCA), pp.77-88, June 2008. 10.1109\/isca.2008.19","DOI":"10.1145\/1394608.1382129"},{"key":"11","unstructured":"[11] Scott Parker, \u201cBG\/Q Architecture,\u201d Mira Performance Boot Camp 2013, https:\/\/www.alcf.anl.gov\/files\/bgq-arch_0.pdf"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Y. Ajima, T. Shimizu, and S. Sumimoto, \u201cTofu: A 6D Mesh\/Torus Interconnect for Exascale Computers,\u201d IEEE Computer, vol.42, no.11, pp.36-40, Nov. 2009. 10.1109\/mc.2009.370","DOI":"10.1109\/MC.2009.370"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Miller and J. \u0160ir\u00e1\u0148, \u201cMoore Graphs and Beyond: A survey of the Degree\/Diameter Problem,\u201d Electronic Journal of Combinatorics, vol.20, no.2, pp.1-92, Nov. 2013.","DOI":"10.37236\/35"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] P.R. Hafner, \u201cThe Hoffman-Singleton Graph and its Automorphisms,\u201d Journal of Algebraic Combinatorics, vol.18, no.1, pp.7-12, 2003. 10.1023\/a:1025136524481","DOI":"10.1023\/A:1025136524481"},{"key":"15","unstructured":"[15] W. Bao, B. Fu, M. Chen, and L. Zhang, \u201cA High-Performance and Cost-Efficient Interconnection Network for High-Density Servers,\u201d Proc. IEEE 10th International Conference on High Performance Computing and Communications & IEEE International Conference on Embedded and Ubiquitous Computing (HPCC_EUC), pp.1246-1253, Nov. 2013."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] P.R. Hafner, \u201cGeometric realisation of the graphs of McKay-Miller-\u0160ir\u00e1\u0148,\u201d Journal of Combinatorial Theory, Series B, vol.90, no.2, pp.223-232, March 2004. 10.1016\/j.jctb.2003.07.002","DOI":"10.1016\/j.jctb.2003.07.002"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] M. Besta and T. Hoefler, \u201cSlim Fly: A Cost Effective Low-DiameterNetwork Topology,\u201d Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp.348-359, Nov. 2014. 10.1109\/sc.2014.34","DOI":"10.1109\/SC.2014.34"},{"key":"18","unstructured":"[18] \u201cGraph golf: The order\/degree problem competition,\u201d http:\/\/research.nii.ac.jp\/graphgolf\/"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] U.Y. Ogras and R. Marculescu, \u201c\u201cIt's a Small World After Al,\u201d: NoC Performance Optimization Via Long-Range Link Insertion,\u201d IEEE Transactions on Very Large Scale Integration Systems (TVLSI), vol.14, no.7, pp.693-706, July 2006. 10.1109\/tvlsi.2006.878263","DOI":"10.1109\/TVLSI.2006.878263"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] F. Silla and J. Duato, \u201cHigh-Performance Routing in Networks of Workstations with Irregular Topology,\u201d IEEE Transactions on Parallel and Distributed Systems (TPDS), vol.11, no.7, pp.699-719, July 2000. 10.1109\/71.877816","DOI":"10.1109\/71.877816"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] J. Domke, T. Hoefler, and W.E. Nagel, \u201cDeadlock-Free Oblivious Routing for Arbitrary Topologies,\u201d Proc. IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.616-627, 2011. 10.1109\/ipdps.2011.65","DOI":"10.1109\/IPDPS.2011.65"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] W.J. Dally and C.L. Seitz, \u201cDeadlock-Free Message Routing in Multiprocessor Interconnection Networks,\u201d IEEE Transactions on Computers (TC), vol.C-36, no.5, pp.547-553, May 1987. 10.1109\/tc.1987.1676939","DOI":"10.1109\/TC.1987.1676939"},{"key":"23","unstructured":"[23] D.M. Chiu, M. Kadansky, R. Perlman, J. Reynders, G. Steele, and M. Yuksel, \u201cDeadlock-free Routing Based on Ordered Links,\u201d Proc. 27th Annual IEEE Conference on Local Computer Networks (LCN), pp.62-71, 2002. 10.1109\/lcn.2002.1181765"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] D.J. Watts and S.H. Strogatz, \u201cCollective dynamics of \u2018small-world\u2019 networks,\u201d Nature, vol.393, no.6684, pp.440-442, June 1998. 10.1038\/30918","DOI":"10.1038\/30918"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016EDP7477\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:17:44Z","timestamp":1750792664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016EDP7477\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7477","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}