{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:58:47Z","timestamp":1772791127844,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1618912"],"award-info":[{"award-number":["CNS-1618912"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1145\/3243176.3243205","type":"proceedings-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T13:32:32Z","timestamp":1539178352000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Graphphi"],"prefix":"10.1145","author":[{"given":"Zhen","family":"Peng","sequence":"first","affiliation":[{"name":"College of William & Mary"}]},{"given":"Alexander","family":"Powell","sequence":"additional","affiliation":[{"name":"College of William & Mary"}]},{"given":"Bo","family":"Wu","sequence":"additional","affiliation":[{"name":"Colorado School of Mines"}]},{"given":"Tekin","family":"Bicer","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory"}]},{"given":"Bin","family":"Ren","sequence":"additional","affiliation":[{"name":"College of William & Mary"}]}],"member":"320","published-online":{"date-parts":[[2018,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2017. Friendster network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/friendster  2017. Friendster network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/friendster"},{"key":"e_1_3_2_1_2_1","unstructured":"2017. Graph500: Benchmark Specification. http:\/\/graph500.org\/?page_id=12#tbl:classes  2017. Graph500: Benchmark Specification. http:\/\/graph500.org\/?page_id=12#tbl:classes"},{"key":"e_1_3_2_1_3_1","unstructured":"2017. Live Journal network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/soc-LiveJournal1  2017. Live Journal network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/soc-LiveJournal1"},{"key":"e_1_3_2_1_4_1","unstructured":"2017. Pokec network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/soc-pokec-relationships  2017. Pokec network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/soc-pokec-relationships"},{"key":"e_1_3_2_1_5_1","unstructured":"2017. Twitter (WWW) network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/twitter  2017. Twitter (WWW) network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/twitter"},{"key":"e_1_3_2_1_6_1","volume-title":"SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS)","author":"Besta Maciej","year":"2017","unstructured":"Maciej Besta , Florian Marending , Edgar Solomonik , and Torsten Hoefler . 2017 . SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS) , 2017 IEEE International. IEEE, 32--41. Maciej Besta, Florian Marending, Edgar Solomonik, and Torsten Hoefler. 2017. SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS), 2017 IEEE International. IEEE, 32--41."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2013.6704684"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.88"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854038.2854046"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370866"},{"key":"e_1_3_2_1_15_1","first-page":"2","article-title":"PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs","volume":"12","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez , Yucheng Low , Haijie Gu , Danny Bickson , and Carlos Guestrin . 2012 . PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs .. In OSDI , Vol. 12. 2 . Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.. In OSDI, Vol. 12. 2.","journal-title":"OSDI"},{"key":"e_1_3_2_1_16_1","volume-title":"Using MPI: Portable Parallel Programming with the Message-passing Interface","author":"Gropp William","unstructured":"William Gropp , Ewing Lusk , and Anthony Skjellum . 1999. Using MPI: Portable Parallel Programming with the Message-passing Interface . Vol. 1 . MIT Press . William Gropp, Ewing Lusk, and Anthony Skjellum. 1999. Using MPI: Portable Parallel Programming with the Message-passing Interface. Vol. 1. MIT Press."},{"key":"e_1_3_2_1_17_1","volume-title":"Owens","author":"Gupta Kshitij","year":"2012","unstructured":"Kshitij Gupta , Jeff A. Stuart , and John D . Owens . 2012 . A Study of Persistent Threads Style GPU Programming for GPGPU Workloads. In Innovative Parallel Computing . 14. Kshitij Gupta, Jeff A. Stuart, and John D. Owens. 2012. A Study of Persistent Threads Style GPU Programming for GPGPU Workloads. In Innovative Parallel Computing. 14."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.41"},{"key":"e_1_3_2_1_19_1","volume-title":"MultiGraph: Efficient Graph Processing on GPUs. In 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 27--40","author":"Hong Changwan","year":"2017","unstructured":"Changwan Hong , Aravind Sukumaran-Rajam , Jinsung Kim , and P Sadayappan . 2017 . MultiGraph: Efficient Graph Processing on GPUs. In 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 27--40 . Changwan Hong, Aravind Sukumaran-Rajam, Jinsung Kim, and P Sadayappan. 2017. MultiGraph: Efficient Graph Processing on GPUs. In 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 27--40."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"James Jeffers James Reinders and Avinash Sodani. 2016. Intel Xeon Phi Processor High Performance Programming: Knights Landing Edition. Morgan Kaufmann.   James Jeffers James Reinders and Avinash Sodani. 2016. Intel Xeon Phi Processor High Performance Programming: Knights Landing Edition . Morgan Kaufmann.","DOI":"10.1016\/B978-0-12-809194-4.00002-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926285"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_3_2_1_24_1","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX.","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola , Guy E Blelloch , and Carlos Guestrin . 2012 . Graphchi: Large-Scale Graph Computation on Just a PC . In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX. Aapo Kyrola, Guy E Blelloch, and Carlos Guestrin. 2012. Graphchi: Large-Scale Graph Computation on Just a PC. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205289.3205313"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807594"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882959"},{"key":"e_1_3_2_1_28_1","volume-title":"Graphlab: A New Framework for Parallel Machine Learning. arXiv preprint arXiv:1408.2041","author":"Low Yucheng","year":"2014","unstructured":"Yucheng Low , Joseph E Gonzalez , Aapo Kyrola , Danny Bickson , Carlos E Guestrin , and Joseph Hellerstein . 2014 . Graphlab: A New Framework for Parallel Machine Learning. arXiv preprint arXiv:1408.2041 (2014). Yucheng Low, Joseph E Gonzalez, Aapo Kyrola, Danny Bickson, Carlos E Guestrin, and Joseph Hellerstein. 2014. Graphlab: A New Framework for Parallel Machine Learning. arXiv preprint arXiv:1408.2041 (2014)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.52"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503242"},{"key":"e_1_3_2_1_36_1","volume-title":"SC12","author":"Krste Asanovic David Patterson Scott Beamer","year":"2012","unstructured":"Scott Beamer Krste Asanovic David Patterson . 2012 . Direction-Optimizing Breadth-First Search . SC12 , November (2012), 10--16. Scott Beamer Krste Asanovic David Patterson. 2012. Direction-Optimizing Breadth-First Search. SC12, November (2012), 10--16."},{"key":"e_1_3_2_1_37_1","volume-title":"Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. \"O'Reilly Media","author":"Reinders James","unstructured":"James Reinders . 2007. Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. \"O'Reilly Media , Inc .\". James Reinders. 2007. Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. \"O'Reilly Media, Inc.\"."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807655"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442530"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2015.7477467"},{"key":"e_1_3_2_1_42_1","volume-title":"Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on. IEEE, 1--8.","author":"Soman Jyothish","year":"2010","unstructured":"Jyothish Soman , Kothapalli Kishore , and PJ Narayanan . 2010 . A Fast GPU Algorithm for Graph Connectivity. In Parallel & Distributed Processing , Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on. IEEE, 1--8. Jyothish Soman, Kothapalli Kishore, and PJ Narayanan. 2010. A Fast GPU Algorithm for Graph Connectivity. In Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on. IEEE, 1--8."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442523"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3168818"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950408"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688507"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.111"}],"event":{"name":"PACT '18: International conference on Parallel Architectures and Compilation Techniques","location":"Limassol Cyprus","acronym":"PACT '18","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IFIP WG 10.3 IFIP WG 10.3","IEEE CS"]},"container-title":["Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243176.3243205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243176.3243205","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243176.3243205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:39Z","timestamp":1750208259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243176.3243205"}},"subtitle":["efficient parallel graph processing on emerging throughput-oriented architectures"],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":50,"alternative-id":["10.1145\/3243176.3243205","10.1145\/3243176"],"URL":"https:\/\/doi.org\/10.1145\/3243176.3243205","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]},"assertion":[{"value":"2018-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}