{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:59:37Z","timestamp":1755838777668,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T00:00:00Z","timestamp":1550275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["687628"],"award-info":[{"award-number":["687628"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["61970"],"award-info":[{"award-number":["61970"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,2,16]]},"DOI":"10.1145\/3293883.3295703","type":"proceedings-article","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T20:44:12Z","timestamp":1549399452000},"page":"391-392","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["VEBO"],"prefix":"10.1145","author":[{"given":"Jiawen","family":"Sun","sequence":"first","affiliation":[{"name":"The Queen's University of Belfast"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Vandierendonck","sequence":"additional","affiliation":[{"name":"The Queen's University of Belfast"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios S.","family":"Nikolopoulos","sequence":"additional","affiliation":[{"name":"The Queen's University of Belfast"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"M. Besta F. Marending E. Solomonik and T. Hoefler. 2017. SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In IPDPS. 32--41.  M. Besta F. Marending E. Solomonik and T. Hoefler. 2017. SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In IPDPS. 32--41.","DOI":"10.1109\/IPDPS.2017.93"},{"key":"e_1_3_2_1_2_1","unstructured":"J. E. Gonzalez Y. Low H. Gu D. Bickson and C. Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.. In OSDI.   J. E. Gonzalez Y. Low H. Gu D. Bickson and C. Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.. In OSDI."},{"key":"e_1_3_2_1_3_1","article-title":"Bounds on Multiprocessing Timing Anomalies. In SIAM","author":"Graham R. L.","year":"1969","unstructured":"R. L. Graham . 1969 . Bounds on Multiprocessing Timing Anomalies. In SIAM J. Appl. Math. 416--429. R. L. Graham. 1969. Bounds on Multiprocessing Timing Anomalies. In SIAM J. Appl. Math. 416--429.","journal-title":"J. Appl. Math. 416--429."},{"key":"e_1_3_2_1_4_1","first-page":"31","article-title":"GraphChi: Large-Scale Graph Computation on Just a PC","volume":"12","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. E. Blelloch , and C. Guestrin . 2012 . GraphChi: Large-Scale Graph Computation on Just a PC . In OSDI , Vol. 12. 31 -- 46 . A. Kyrola, G. E. Blelloch, and C. Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC. In OSDI, Vol. 12. 31--46.","journal-title":"OSDI"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_7_1","volume-title":"VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing. eprint arXiv:1806.06576 (June","author":"Sun J.","year":"2018","unstructured":"J. Sun , H. Vandierendonck , and D. S. Nikolopoulos . 2018 . VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing. eprint arXiv:1806.06576 (June 2018). J. Sun, H. Vandierendonck, and D. S. Nikolopoulos. 2018. VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing. eprint arXiv:1806.06576 (June 2018)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688507"},{"key":"e_1_3_2_1_9_1","unstructured":"Y. Zhang M. Yang R. Baghadi S. Kamil J. Shun and A. Amarasinghe. 2018. Graphlt - A High-Performance DSL for Graph Analytics. eprint arXiv:1805.00923 (June 2018).  Y. Zhang M. Yang R. Baghadi S. Kamil J. Shun and A. Amarasinghe. 2018. Graphlt - A High-Performance DSL for Graph Analytics. eprint arXiv:1805.00923 (June 2018)."},{"key":"e_1_3_2_1_10_1","volume-title":"Gemini: A Computation-Centric Distributed Graph Processing System. In OSDI. 301--316.","author":"Zhu X.","year":"2016","unstructured":"X. Zhu , W. Chen , W. Zheng , and X. Ma . 2016 . Gemini: A Computation-Centric Distributed Graph Processing System. In OSDI. 301--316. X. Zhu, W. Chen, W. Zheng, and X. Ma. 2016. Gemini: A Computation-Centric Distributed Graph Processing System. In OSDI. 301--316."}],"event":{"name":"PPoPP '19: 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Washington District of Columbia","acronym":"PPoPP '19"},"container-title":["Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293883.3295703","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293883.3295703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:47Z","timestamp":1750208507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293883.3295703"}},"subtitle":["a vertex- and edge-balanced ordering heuristic to load balance parallel graph processing"],"short-title":[],"issued":{"date-parts":[[2019,2,16]]},"references-count":10,"alternative-id":["10.1145\/3293883.3295703","10.1145\/3293883"],"URL":"https:\/\/doi.org\/10.1145\/3293883.3295703","relation":{},"subject":[],"published":{"date-parts":[[2019,2,16]]},"assertion":[{"value":"2019-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}