{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:20Z","timestamp":1767340280662,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T00:00:00Z","timestamp":1464652800000},"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":[[2016,5,31]]},"DOI":"10.1145\/2907294.2907313","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T19:23:42Z","timestamp":1464895422000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Routing on the Dependency Graph"],"prefix":"10.1145","author":[{"given":"Jens","family":"Domke","sequence":"first","affiliation":[{"name":"TU Dresden, Dresden, Germany"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Satoshi","family":"Matsuoka","sequence":"additional","affiliation":[{"name":"Tokyo Tech, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132953"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795698.798401"},{"key":"e_1_3_2_1_4_1","volume-title":"Principles and Practices of Interconnection Networks","author":"Dally W.","year":"2003","unstructured":"W. Dally and B. Towles . Principles and Practices of Interconnection Networks . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 2003 . W. Dally and B. Towles. Principles and Practices of Interconnection Networks. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/325164.325115"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676939"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.54"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.65"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389136"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646349.690713"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.190"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.72"},{"key":"e_1_3_2_1_14_1","unstructured":"GSIC. TSUBAME2 Hardware Architecture. http:\/\/tsubame.gsic.titech.ac.jp\/en\/hardware-architecture Jan. 2016.  GSIC. TSUBAME2 Hardware Architecture. http:\/\/tsubame.gsic.titech.ac.jp\/en\/hardware-architecture Jan. 2016."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90022-X"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTR.2008.4663762"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2009.9"},{"key":"e_1_3_2_1_18_1","volume-title":"Infiniband Architecture Specification","author":"InfiniBand Trade Association","year":"2007","unstructured":"InfiniBand Trade Association . Infiniband Architecture Specification Volume 1 , Release 1.2.1, 2007 . InfiniBand Trade Association. Infiniband Architecture Specification Volume 1, Release 1.2.1, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555782"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645535.657007"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30141-7_45"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899038"},{"key":"e_1_3_2_1_25_1","volume-title":"Mellanox OFED for Linux User Manual, rev 2.0-3.0.0 edition","author":"Technologies Mellanox","year":"2013","unstructured":"Mellanox Technologies . Mellanox OFED for Linux User Manual, rev 2.0-3.0.0 edition , 2013 . Mellanox Technologies. Mellanox OFED for Linux User Manual, rev 2.0-3.0.0 edition, 2013."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-37801-0","volume-title":"Parallel Programming: for Multicore and Cluster Systems","author":"Rauber T.","year":"2013","unstructured":"T. Rauber and G. R\u00fcnger . Parallel Programming: for Multicore and Cluster Systems . Springer-Verlag , 2013 . T. Rauber and G. R\u00fcnger. Parallel Programming: for Multicore and Cluster Systems. Springer-Verlag, 2013."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646348.690556"},{"key":"e_1_3_2_1_28_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/10720115_4","volume-title":"Network-Based Parallel Computing. Communication, Architecture, and Applications","author":"Sancho J. C.","year":"2000","unstructured":"J. C. Sancho , A. Robles , and J. Duato . A new methodology to compute deadlock-free routing tables for irregular networks . In Network-Based Parallel Computing. Communication, Architecture, and Applications , volume 1797 of Lecture Notes in Computer Science , pages 45 -- 60 . Springer Berlin Heidelberg , 2000 . J. C. Sancho, A. Robles, and J. Duato. A new methodology to compute deadlock-free routing tables for irregular networks. In Network-Based Parallel Computing. Communication, Architecture, and Applications, volume 1797 of Lecture Notes in Computer Science, pages 45--60. Springer Berlin Heidelberg, 2000."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.105178"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOCS.2009.5071443"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009385.1010104"},{"key":"e_1_3_2_1_32_1","volume-title":"Layered Shortest Path (LASH) Routing in Irregular System Area Networks. In IPDPS '02: Proceedings of the 16th International Parallel and Distributed Processing Symposium","author":"Skeie T.","year":"2002","unstructured":"T. Skeie , O. Lysne , and I. Theiss . Layered Shortest Path (LASH) Routing in Irregular System Area Networks. In IPDPS '02: Proceedings of the 16th International Parallel and Distributed Processing Symposium , Washington, DC, USA , 2002 . IEEE Computer Society Press. T. Skeie, O. Lysne, and I. Theiss. Layered Shortest Path (LASH) Routing in Irregular System Area Networks. In IPDPS '02: Proceedings of the 16th International Parallel and Distributed Processing Symposium, Washington, DC, USA, 2002. IEEE Computer Society Press."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v22:2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0477-0"}],"event":{"name":"HPDC'16: The 25th International Symposium on High-Performance Parallel and Distributed Computing","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Kyoto Japan","acronym":"HPDC'16"},"container-title":["Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907294.2907313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2907294.2907313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:26Z","timestamp":1750222466000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907294.2907313"}},"subtitle":["A New Approach to Deadlock-Free High-Performance Routing"],"short-title":[],"issued":{"date-parts":[[2016,5,31]]},"references-count":34,"alternative-id":["10.1145\/2907294.2907313","10.1145\/2907294"],"URL":"https:\/\/doi.org\/10.1145\/2907294.2907313","relation":{},"subject":[],"published":{"date-parts":[[2016,5,31]]},"assertion":[{"value":"2016-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}