{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:29Z","timestamp":1772164049360,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,2,27]],"date-time":"2016-02-27T00:00:00Z","timestamp":1456531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG","award":["ME 2088\/3-1"],"award-info":[{"award-number":["ME 2088\/3-1"]}]},{"name":"Sandia LDRD","award":["130144"],"award-info":[{"award-number":["130144"]}]},{"name":"MADALGO (Center for Massive Data Algorithmics)"},{"name":"UC Lab Fees Research Program Award","award":["12-LR-238449"],"award-info":[{"award-number":["12-LR-238449"]}]},{"name":"NSF","award":["CCF-1017399, OCI-1032859"],"award-info":[{"award-number":["CCF-1017399, OCI-1032859"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,2,27]]},"DOI":"10.1145\/2851141.2851169","type":"proceedings-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T08:18:49Z","timestamp":1456129129000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["GPU multisplit"],"prefix":"10.1145","author":[{"given":"Saman","family":"Ashkiani","sequence":"first","affiliation":[{"name":"University of California, Davis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Davidson","sequence":"additional","affiliation":[{"name":"University of California, Davis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[{"name":"Goethe-Universit\u00e4t Frankfurt am Main"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Owens","sequence":"additional","affiliation":[{"name":"University of California, Davis"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,2,27]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"July","author":"0","year":"2013","unstructured":"The Graph 50 0 list. http:\/\/www.graph500.org\/ , July 2013 . The Graph 500 list. http:\/\/www.graph500.org\/, July 2013."},{"key":"e_1_3_2_1_2_1","volume-title":"July","year":"2013","unstructured":"Yahoo labs dataset selections. http:\/\/webscope.sandbox.yahoo.com\/ , July 2013 . Yahoo labs dataset selections. http:\/\/webscope.sandbox.yahoo.com\/, July 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618500"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.69"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen J.","year":"2009","unstructured":"J. Bang-Jensen and G. Z. Gutin . Digraphs: Theory, Algorithms and Applications , chapter 3.3.4: The Bellman-Ford-Moore Algorithm, pages 97 -- 99 . Springer-Verlag London , 2009 . doi: 10.1007\/978-1-84800-998-1. 10.1007\/978-1-84800-998-1 J. Bang-Jensen and G. Z. Gutin. Digraphs: Theory, Algorithms and Applications, chapter 3.3.4: The Bellman-Ford-Moore Algorithm, pages 97--99. Springer-Verlag London, 2009. doi: 10.1007\/978-1-84800-998-1."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339589"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442536"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2013.6799129"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_13_1","first-page":"851","volume-title":"Parallel prefix sum (scan) with CUDA","author":"Harris M.","year":"2007","unstructured":"M. Harris , S. Sengupta , and J. D. Owens . Parallel prefix sum (scan) with CUDA . In H. Nguyen, editor, GPU Gems 3, chapter 39, pages 851 -- 876 . Addison Wesley , Aug. 2007 . M. Harris, S. Sengupta, and J. D. Owens. Parallel prefix sum (scan) with CUDA. In H. Nguyen, editor, GPU Gems 3, chapter 39, pages 851--876. Addison Wesley, Aug. 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376670"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.88"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.31"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645610.661895"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00046-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_21_1","series-title":"Advances in Computing Research","first-page":"47","volume-title":"Randomness and Computation","author":"Miller G. L.","year":"1989","unstructured":"G. L. Miller and J. H. Reif . Parallel tree contraction---Part 1: Fundamentals . In S. Micali, editor, Randomness and Computation , volume 5 of Advances in Computing Research , pages 47 -- 72 . JAI Press Inc ., 1989 . ISBN 9780892328963. G. L. Miller and J. H. Reif. Parallel tree contraction---Part 1: Fundamentals. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 47--72. JAI Press Inc., 1989. ISBN 9780892328963."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018323.2018338"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365490.1365500"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1964179.1964181"},{"key":"e_1_3_2_1_25_1","volume-title":"Aug.","author":"NVIDIA Corporation","year":"2014","unstructured":"NVIDIA Corporation . NVIDIA CUDA C programming guide. PG-02829-001 v6.5 , Aug. 2014 . NVIDIA Corporation. NVIDIA CUDA C programming guide. PG-02829-001 v6.5, Aug. 2014."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018323.2018339"},{"key":"e_1_3_2_1_27_1","volume-title":"Scalable primitives for data mapping and movement on the GPU. Master's thesis","author":"Patidar S.","year":"2009","unstructured":"S. Patidar . Scalable primitives for data mapping and movement on the GPU. Master's thesis , International Institute of Information Technology, Hyderabad , India, June 2009 . S. Patidar. Scalable primitives for data mapping and movement on the GPU. Master's thesis, International Institute of Information Technology, Hyderabad, India, June 2009."},{"key":"e_1_3_2_1_28_1","first-page":"418","volume-title":"Proceedings of the International Conference on Signal Processing and Communications Systems (ICSPCS)","author":"Shams R.","year":"2007","unstructured":"R. Shams and R. A. Kennedy . Efficient histogram algorithms for NVIDIA CUDA compatible devices . In Proceedings of the International Conference on Signal Processing and Communications Systems (ICSPCS) , pages 418 -- 422 , Gold Coast, Australia , Dec. 2007 . R. Shams and R. A. Kennedy. Efficient histogram algorithms for NVIDIA CUDA compatible devices. In Proceedings of the International Conference on Signal Processing and Communications Systems (ICSPCS), pages 418--422, Gold Coast, Australia, Dec. 2007."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018323.2018335"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.07.002"}],"event":{"name":"PPoPP '16: 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Barcelona Spain","acronym":"PPoPP '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851141.2851169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851141.2851169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:28Z","timestamp":1750211008000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851141.2851169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,27]]},"references-count":28,"alternative-id":["10.1145\/2851141.2851169","10.1145\/2851141"],"URL":"https:\/\/doi.org\/10.1145\/2851141.2851169","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3016078.2851169","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,2,27]]},"assertion":[{"value":"2016-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}