{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:40Z","timestamp":1763468080352,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T00:00:00Z","timestamp":1348012800000},"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":[[2012,9,19]]},"DOI":"10.1145\/2370816.2370866","type":"proceedings-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T23:48:43Z","timestamp":1348616923000},"page":"345-354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":97,"title":["A yoke of oxen and a thousand chickens for heavy lifting graph processing"],"prefix":"10.1145","author":[{"given":"Abdullah","family":"Gharaibeh","sequence":"first","affiliation":[{"name":"The University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Lauro","family":"Beltr\u00e3o Costa","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Elizeu","family":"Santos-Neto","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Matei","family":"Ripeanu","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Vancouver, BC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_3_2_1_2_1","first-page":"67","author":"Barabasi A.-L.","year":"2003","unstructured":"Barabasi , A.-L. Linked : How Everything Is Connected to Everything Else and What It Means. Recherche 67 , ( 2003 ). Barabasi, A.-L. Linked: How Everything Is Connected to Everything Else and What It Means. Recherche 67, (2003).","journal-title":"Everything Else and What It Means. Recherche"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971538"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782174.1782200"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941590"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_10_1","volume-title":"SIGGRAPH\/EUROGRAPHICS","author":"Katz G.J.","year":"2008","unstructured":"Katz , G.J. and Kider Jr, J.T. All-pairs shortest-paths for large graphs on the GPU . SIGGRAPH\/EUROGRAPHICS , ( 2008 ). Katz, G.J. and Kider Jr, J.T. All-pairs shortest-paths for large graphs on the GPU. SIGGRAPH\/EUROGRAPHICS, (2008)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo M.L.","year":"2012","unstructured":"Pinedo , M.L. Scheduling: Theory, Algorithms, and Systems . Springer Verlag , 2012 . Pinedo, M.L. Scheduling: Theory, Algorithms, and Systems. Springer Verlag, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70811"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"e_1_3_2_1_17_1","volume-title":"ICPDCS","author":"Xia Y.","year":"2009","unstructured":"Xia , Y. and Prasanna , V.K . Topologically Adaptive Parallel Breadth-First Search on Multicore Processors . ICPDCS , ( 2009 ). Xia, Y. and Prasanna, V.K. Topologically Adaptive Parallel Breadth-First Search on Multicore Processors. ICPDCS, (2009)."},{"key":"e_1_3_2_1_18_1","volume-title":"Paving the Way to Exascale","author":"TITAN","year":"2011","unstructured":"TITAN : Paving the Way to Exascale . 2011 . TITAN: Paving the Way to Exascale. 2011."},{"key":"e_1_3_2_1_19_1","unstructured":"Graph500. 2012. http:\/\/www.graph500.org.  Graph500. 2012. http:\/\/www.graph500.org."},{"key":"e_1_3_2_1_20_1","unstructured":"Top500. 2012. http:\/\/www.top500.org\/.  Top500. 2012. http:\/\/www.top500.org\/."}],"event":{"name":"PACT '12: International Conference on Parallel Architectures and Compilation Techniques","sponsor":["IFIP WG 10.3 IFIP WG 10.3","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS TCPP IEEE Computer Society Technical Committee on Parallel Processing","IEEE CS TCAA IEEE CS technical committee on architectural acoustics"],"location":"Minneapolis Minnesota USA","acronym":"PACT '12"},"container-title":["Proceedings of the 21st international conference on Parallel architectures and compilation techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370816.2370866","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2370816.2370866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:17Z","timestamp":1750239257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370816.2370866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":20,"alternative-id":["10.1145\/2370816.2370866","10.1145\/2370816"],"URL":"https:\/\/doi.org\/10.1145\/2370816.2370866","relation":{},"subject":[],"published":{"date-parts":[[2012,9,19]]},"assertion":[{"value":"2012-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}