{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T11:44:21Z","timestamp":1790163861195,"version":"4.1.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T00:00:00Z","timestamp":1461628800000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2016,4,26]]},"abstract":"<jats:p>Data-centric abstractions and execution strategies are needed to exploit parallelism in large-scale graph analytics.<\/jats:p>","DOI":"10.1145\/2901919","type":"journal-article","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T12:10:51Z","timestamp":1461759051000},"page":"78-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Parallel graph analytics"],"prefix":"10.1145","volume":"59","author":[{"given":"Andrew","family":"Lenharth","sequence":"first","affiliation":[{"name":"University of Texas at Austin"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donald","family":"Nguyen","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,4,26]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/59912"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/500824"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.89"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v31:4"},{"key":"e_1_2_2_8_1","unstructured":"Giraph; http:\/\/giraph.apache.org\/  Giraph; http:\/\/giraph.apache.org\/"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387880.2387883"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782174.1782200"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2385452"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/133889"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2014.24"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919639"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993562"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335170"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence","author":"Low Y.","year":"2010","unstructured":"Low , Y. , Gonzalez , J. , Kyrola , A. , Bickson , D. , Guestrin , C. , and Hellerstein , J.M . GraphLab: A new parallel framework for machine learning . In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence ( Catalina Island, CA, July 8--11). Association for Uncertainty in Artificial Intelligence , 2010 . Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., and Hellerstein, J.M. GraphLab: A new parallel framework for machine learning. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (Catalina Island, CA, July 8--11). Association for Uncertainty in Artificial Intelligence, 2010."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365808"},{"key":"e_1_2_2_22_1","volume-title":"Eds. Chapman and Hall\/CRC","author":"Madduri K.","year":"2007","unstructured":"Madduri , K. , Feo , J. , Cong , G. , and Bader , D.A . Design of multithreaded algorithms for combinatorial problems. Chapter 31 in Handbook of Parallel Computing: Models, Algorithms and Applications, S. Rajasekaran and J. Reif , Eds. Chapman and Hall\/CRC , Boca Raton, FL , 2007 . Madduri, K., Feo, J., Cong, G., and Bader, D.A. Design of multithreaded algorithms for combinatorial problems. Chapter 31 in Handbook of Parallel Computing: Models, Algorithms and Applications, S. Rajasekaran and J. Reif, Eds. Chapman and Hall\/CRC, Boca Raton, FL, 2007."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/647908.740136"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442531"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541964"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737953"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.752782"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610518"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_2_2_35_1","volume-title":"The Boost Graph Library: User Guide and Reference Manual","author":"Siek J.","year":"2001","unstructured":"Siek , J. , Lee , L.-Q. , and Lumsdaine , A . The Boost Graph Library: User Guide and Reference Manual . Addison-Wesley , Reading, MA , 2001 . Siek, J., Lee, L.-Q., and Lumsdaine, A. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, Reading, MA, 2001."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2901919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2901919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:59Z","timestamp":1750222499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2901919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,26]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,4,26]]}},"alternative-id":["10.1145\/2901919"],"URL":"https:\/\/doi.org\/10.1145\/2901919","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,26]]},"assertion":[{"value":"2016-04-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}