{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:56:35Z","timestamp":1761580595068,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T00:00:00Z","timestamp":1194652800000},"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":[[2007,11,10]]},"DOI":"10.1145\/1362622.1362630","type":"proceedings-article","created":{"date-parts":[[2008,4,22]],"date-time":"2008-04-22T19:41:13Z","timestamp":1208893273000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Age-based packet arbitration in large-radix\n            <i>k<\/i>\n            -ary\n            <i>n<\/i>\n            -cubes"],"prefix":"10.1145","author":[{"given":"Dennis","family":"Abts","sequence":"first","affiliation":[{"name":"Cray Inc., Chippewa Falls, Wisconsin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deborah","family":"Weisser","sequence":"additional","affiliation":[{"name":"Google Inc., Mountain View, California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Cray XT3. http:\/\/www.cray.com\/products\/xt3\/.  Cray XT3. http:\/\/www.cray.com\/products\/xt3\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.53599"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/139669.140384"},{"key":"e_1_3_2_1_5_1","unstructured":"HPCC Challenge Benchmarks. http:\/\/icl.cs.utk.edu\/hpcc\/.  HPCC Challenge Benchmarks. http:\/\/icl.cs.utk.edu\/hpcc\/."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1151699.1151716"},{"key":"e_1_3_2_1_7_1","first-page":"267","article-title":"Virtual cut-through: A new computer communication switching technique","volume":"3","author":"Kermani P.","year":"1979","unstructured":"P. Kermani and L. Kleinrock . Virtual cut-through: A new computer communication switching technique . Computer Networks , 3 : 267 -- 286 , 1979 . P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267--286, 1979.","journal-title":"Computer Networks"}],"event":{"name":"SC '07: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"],"location":"Reno Nevada","acronym":"SC '07"},"container-title":["Proceedings of the 2007 ACM\/IEEE conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1362622.1362630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1362622.1362630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:31Z","timestamp":1750254991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1362622.1362630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,10]]},"references-count":7,"alternative-id":["10.1145\/1362622.1362630","10.1145\/1362622"],"URL":"https:\/\/doi.org\/10.1145\/1362622.1362630","relation":{},"subject":[],"published":{"date-parts":[[2007,11,10]]},"assertion":[{"value":"2007-11-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}