{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:38Z","timestamp":1750307318739,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-215030 (ELITE)"],"award-info":[{"award-number":["FP7-ICT-215030 (ELITE)"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1145\/1999946.1999956","type":"proceedings-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T17:34:50Z","timestamp":1309282490000},"page":"57-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal network architectures for minimizing average distance in k-ary n-dimensional mesh networks"],"prefix":"10.1145","author":[{"given":"Matt","family":"Grange","sequence":"first","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"given":"Roshan","family":"Weerasekera","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"given":"Dinesh","family":"Pamunuwa","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"given":"Axel","family":"Jantsch","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Kista, Sweden"}]},{"given":"Awet Yemane","family":"Weldezion","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Kista, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2011,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.97897"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1951.tb00067.x"},{"key":"e_1_3_2_1_3_1","volume-title":"Morgan Kaufmann","author":"Dally W.","year":"2004","unstructured":"W. Dally and B. Towles . Principles and practices of interconnection networks . Morgan Kaufmann , 2004 . W. Dally and B. Towles. Principles and practices of interconnection networks. Morgan Kaufmann, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.53599"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1870926.1871319"},{"key":"e_1_3_2_1_6_1","volume-title":"VLSI Design","author":"Guz Z.","year":"2007","unstructured":"Z. Guz , I. Walter , E. Bolotin , I. Cidon , R. Ginosar , and A. Kolodny . Network delays and link capacities in application-specific wormhole NoCs . VLSI Design , 2007 . Z. Guz, I. Walter, E. Bolotin, I. Cidon, R. Ginosar, and A. Kolodny. Network delays and link capacities in application-specific wormhole NoCs. VLSI Design, 2007."},{"key":"e_1_3_2_1_7_1","volume-title":"Department of Computer and Information Science","author":"Holsmark R.","year":"2009","unstructured":"R. Holsmark . Deadlock free routing in mesh networks on chip with regions. Licentiate thesis , Department of Computer and Information Science , Link\u00f6pings Universitet , 2009 . R. Holsmark. Deadlock free routing in mesh networks on chip with regions. Licentiate thesis, Department of Computer and Information Science, Link\u00f6pings Universitet, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2063130"},{"key":"e_1_3_2_1_9_1","first-page":"547","article-title":"A general analytical model of adaptive wormhole routing in k-ary n-cube interconnection networks","volume":"35","author":"Khonsari A.","year":"2003","unstructured":"A. Khonsari , M. Ould-Khaoua , and J. Ferguson . A general analytical model of adaptive wormhole routing in k-ary n-cube interconnection networks . SIMULATION SERIES , 35 : 547 -- 554 , 2003 . A. Khonsari, M. Ould-Khaoua, and J. Ferguson. A general analytical model of adaptive wormhole routing in k-ary n-cube interconnection networks. SIMULATION SERIES, 35:547--554, 2003.","journal-title":"SIMULATION SERIES"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2008.83"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI.2008.40"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/331697.332322"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of Design Automation and Test Europe Conf.","author":"Lu Z.","year":"2009","unstructured":"Z. Lu , M. Millberg , A. Jantsch , A. Bruce , P. Van der Wolf, and T. Henriksson. Flow regulation for on-chip communication . In Proc. of Design Automation and Test Europe Conf. , April 2009 . Z. Lu, M. Millberg, A. Jantsch, A. Bruce, P. Van der Wolf, and T. Henriksson. Flow regulation for on-chip communication. In Proc. of Design Automation and Test Europe Conf., April 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061613"},{"key":"e_1_3_2_1_15_1","volume-title":"Worst-case flit and packet delay bounds in wormhole networks on chip. IEICE Transactions, 92--A(12):3211--3220","author":"Qian Y.","year":"2009","unstructured":"Y. Qian , Z. Lu , and W. Dou . Worst-case flit and packet delay bounds in wormhole networks on chip. IEICE Transactions, 92--A(12):3211--3220 , 2009 . Y. Qian, Z. Lu, and W. Dou. Worst-case flit and packet delay bounds in wormhole networks on chip. IEICE Transactions, 92--A(12):3211--3220, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2043572"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOCS.2009.5071459"}],"event":{"name":"NOCS'11: International Symposium on Networks-on-Chips","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems","SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pittsburgh Pennsylvania","acronym":"NOCS'11"},"container-title":["Proceedings of the Fifth ACM\/IEEE International Symposium on Networks-on-Chip"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1999946.1999956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1999946.1999956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:51Z","timestamp":1750244751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1999946.1999956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":17,"alternative-id":["10.1145\/1999946.1999956","10.1145\/1999946"],"URL":"https:\/\/doi.org\/10.1145\/1999946.1999956","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]},"assertion":[{"value":"2011-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}