{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T15:51:38Z","timestamp":1722613898271},"reference-count":5,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2016edl8099","type":"journal-article","created":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T22:15:20Z","timestamp":1477952120000},"page":"2821-2823","source":"Crossref","is-referenced-by-count":2,"title":["Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Antoine","family":"BOSSARD","sequence":"first","affiliation":[{"name":"Kanagawa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiichi","family":"KANEKO","sequence":"additional","affiliation":[{"name":"Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] J. Moroo, M. Yamada, and T. Kato, \u201cOperation system for the K computer,\u201d Fujitsu Sci. Tech. J., vol.48, no.3, pp.295-301, 2012."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A. Singh, W.J. Dally, A.K. Gupta, and B. Towles, \u201cGoal: A load-balanced adaptive routing algorithm for torus networks,\u201d SIGARCH Computer Architecture News, vol.31, no.2, pp.194-205, 2003.","DOI":"10.1145\/871656.859641"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J.M. Camara, M. Moreto, E. Vallejo, R. Beivide, J. Miguel-Alonso, C. Martinez, and J. Navaridas, \u201cTwisted torus topologies for enhanced interconnection networks,\u201d IEEE Trans. Parallel Distrib. Syst., vol. 21, no.12, pp.1765-1778, 2010.","DOI":"10.1109\/TPDS.2010.30"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Q.-P. Gu and S. Peng, \u201cNode-to-set and set-to-set cluster fault tolerant routing in hypercubes,\u201d Parallel Computing, vol.24, no.8, pp.1245-1261, 1998.","DOI":"10.1016\/S0167-8191(98)00050-7"},{"key":"5","unstructured":"[5] A. Bossard and K. Kaneko, \u201cA set-to-set disjoint paths routing algorithm in a torus-connected cycles network,\u201d Proc. 31st Int. Conf. on Comp. and Their App., pp.81-88, Las Vegas, NV, USA, April 2016."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/11\/E99.D_2016EDL8099\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:28:51Z","timestamp":1498357731000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/11\/E99.D_2016EDL8099\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":5,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edl8099","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}