{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:20Z","timestamp":1750307540977,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,12,12]],"date-time":"2009-12-12T00:00:00Z","timestamp":1260576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,12,12]]},"DOI":"10.1145\/1645213.1645220","type":"proceedings-article","created":{"date-parts":[[2009,12,15]],"date-time":"2009-12-15T12:55:59Z","timestamp":1260881759000},"page":"23-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Path-based, randomized, oblivious, minimal routing"],"prefix":"10.1145","author":[{"given":"Myong Hyon","family":"Cho","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]},{"given":"Mieszko","family":"Lis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]},{"given":"Keun Sup","family":"Shim","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]},{"given":"Michel","family":"Kinsy","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.877831"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.219761"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676939"},{"key":"e_1_3_2_1_4_1","volume-title":"Morgan Kaufmann","author":"Dally W. J.","year":"2003","unstructured":"W. J. Dally and B. Towles . Principles and Practices of Interconnection Networks . Morgan Kaufmann , 2003 . W. J. Dally and B. Towles. Principles and Practices of Interconnection Networks. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185682"},{"key":"e_1_3_2_1_6_1","first-page":"203","volume-title":"Regional Congestion Awareness for Load Balance in Networks-on-Chip. In In Proc. of the 14th Int. Symp. on High-Performance Computer Architecture (HPCA)","author":"Gratz P.","year":"2008","unstructured":"P. Gratz , B. Grot , and S. W. Keckler . Regional Congestion Awareness for Load Balance in Networks-on-Chip. In In Proc. of the 14th Int. Symp. on High-Performance Computer Architecture (HPCA) , pages 203 -- 214 , Feb. 2008 . P. Gratz, B. Grot, and S. W. Keckler. Regional Congestion Awareness for Load Balance in Networks-on-Chip. In In Proc. of the 14th Int. Symp. on High-Performance Computer Architecture (HPCA), pages 203--214, Feb. 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065726"},{"key":"e_1_3_2_1_9_1","first-page":"185","volume-title":"ROMM Routing: A Class of Efficient Minimal Routing Algorithms. In in Proc. Parallel Computer Routing and Communication Workshop","author":"Nesson T.","year":"1994","unstructured":"T. Nesson and S. L. Johnsson . ROMM Routing: A Class of Efficient Minimal Routing Algorithms. In in Proc. Parallel Computer Routing and Communication Workshop , pages 185 -- 199 , 1994 . T. Nesson and S. L. Johnsson. ROMM Routing: A Class of Efficient Minimal Routing Algorithms. In in Proc. Parallel Computer Routing and Communication Workshop, pages 185--199, 1994."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/215399.215455"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.37"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOCS.2009.5071443"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/871656.859641"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2004.8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564872"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777444"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802479"}],"event":{"name":"Micro-42: The 42nd Annual IEEE\/ACM International Symposium on Microarchitecture","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","IEEE-CS TG u-Arch"],"location":"New York New York","acronym":"Micro-42"},"container-title":["Proceedings of the 2nd International Workshop on Network on Chip Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645213.1645220","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1645213.1645220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:24Z","timestamp":1750249404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645213.1645220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,12]]},"references-count":16,"alternative-id":["10.1145\/1645213.1645220","10.1145\/1645213"],"URL":"https:\/\/doi.org\/10.1145\/1645213.1645220","relation":{},"subject":[],"published":{"date-parts":[[2009,12,12]]},"assertion":[{"value":"2009-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}