{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:36:58Z","timestamp":1761896218936,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,3,12]],"date-time":"2016-03-12T00:00:00Z","timestamp":1457740800000},"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,3,12]]},"DOI":"10.1145\/2851553.2851572","type":"proceedings-article","created":{"date-parts":[[2016,3,14]],"date-time":"2016-03-14T13:11:18Z","timestamp":1457961078000},"page":"85-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Parallel Graph Processing"],"prefix":"10.1145","author":[{"given":"Assaf","family":"Eisenman","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludmila","family":"Cherkasova","sequence":"additional","affiliation":[{"name":"Hewlett Packard Labs, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme","family":"Magalhaes","sequence":"additional","affiliation":[{"name":"Hewlett Packard Enterprise, Porto Alegre, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Cai","sequence":"additional","affiliation":[{"name":"Hewlett Packard Labs, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Faraboschi","sequence":"additional","affiliation":[{"name":"Hewlett Packard Labs, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin","family":"Katti","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,3,12]]},"reference":[{"unstructured":"Apache Giraph. http:\/\/giraph.apache.org\/.  Apache Giraph. http:\/\/giraph.apache.org\/.","key":"e_1_3_2_1_1_1"},{"unstructured":"Intel 64 and ia-32 architectures optimization reference manual. http:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/manuals\/64-ia-32-architectures-optimization-manual.pdf.  Intel 64 and ia-32 architectures optimization reference manual. http:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/manuals\/64-ia-32-architectures-optimization-manual.pdf.","key":"e_1_3_2_1_2_1"},{"unstructured":"PAPI\n  : Performance Application Programming Interface. http:\/\/icl.cs.utk.edu\/papi\/.  PAPI: Performance Application Programming Interface. http:\/\/icl.cs.utk.edu\/papi\/.","key":"e_1_3_2_1_3_1"},{"unstructured":"pChase. https:\/\/github.com\/maleadt\/pChase.  pChase. https:\/\/github.com\/maleadt\/pChase.","key":"e_1_3_2_1_4_1"},{"unstructured":"STREAM benchmark. http:\/\/www.cs.virginia.edu\/stream\/.  STREAM benchmark. http:\/\/www.cs.virginia.edu\/stream\/.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2764947.2764954"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/IPDPS.2011.393"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2568088.2576761"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: Large-Scale Graph Computation on Just a PC . In Proc. of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI) , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-Scale Graph Computation on Just a PC. In Proc. of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2012."},{"key":"e_1_3_2_1_11_1","first-page":"48","author":"Lenharth A.","year":"2015","unstructured":"A. Lenharth and K. Pingali . Scaling Runtimes for Irregular Algorithms to Large-Scale NUMA Systems. IEEE Computer Journal, Aug , 48 , 2015 . A. Lenharth and K. Pingali. Scaling Runtimes for Irregular Algorithms to Large-Scale NUMA Systems. IEEE Computer Journal, Aug, 48, 2015.","journal-title":"IEEE Computer Journal, Aug"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.14778\/2212351.2212354"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.14778\/2735508.2735517"},{"issue":"1","key":"e_1_3_2_1_14_1","volume":"17","author":"Lumsdaine A.","year":"2007","unstructured":"A. Lumsdaine , D. Gregor , B. Hendrickson , and J. Berry . Challenges in Parallel Graph Processing. Parallel Processing Letters , 17 ( 1 ), 2007 . A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. Challenges in Parallel Graph Processing. Parallel Processing Letters, 17(1), 2007.","journal-title":"Challenges in Parallel Graph Processing. Parallel Processing Letters"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/ISPASS.2010.5452064"},{"unstructured":"R. Meusel O. Lehmberg C. Bizer and S. Vigna. Extracting the Hyperlink Graphs from the Common Crawl. http:\/\/webdatacommons.org\/hyperlinkgraph.  R. Meusel O. Lehmberg C. Bizer and S. Vigna. Extracting the Hyperlink Graphs from the Common Crawl. http:\/\/webdatacommons.org\/hyperlinkgraph.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/2001252.2001262"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/2517349.2522739"},{"unstructured":"K. Packard. The Machine Architecture. http:\/\/keithp.com\/blogs\/the_machine_architecture.  K. Packard. The Machine Architecture. http:\/\/keithp.com\/blogs\/the_machine_architecture.","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/2588555.2610518"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/2442516.2442530"}],"event":{"sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","SIGSOFT ACM Special Interest Group on Software Engineering"],"acronym":"ICPE'16","name":"ICPE'16: ACM\/SPEC International Conference on Performance Engineering","location":"Delft The Netherlands"},"container-title":["Proceedings of the 7th ACM\/SPEC on International Conference on Performance Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851553.2851572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851553.2851572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:15Z","timestamp":1750221555000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851553.2851572"}},"subtitle":["Prejudice and State of the Art"],"short-title":[],"issued":{"date-parts":[[2016,3,12]]},"references-count":21,"alternative-id":["10.1145\/2851553.2851572","10.1145\/2851553"],"URL":"https:\/\/doi.org\/10.1145\/2851553.2851572","relation":{},"subject":[],"published":{"date-parts":[[2016,3,12]]},"assertion":[{"value":"2016-03-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}