{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T01:41:57Z","timestamp":1774921317311,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T00:00:00Z","timestamp":1464825600000},"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,6,2]]},"DOI":"10.1145\/2908080.2908089","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T15:23:42Z","timestamp":1464881022000},"page":"539-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Higher-order and tuple-based massively-parallel prefix sums"],"prefix":"10.1145","author":[{"given":"Sepideh","family":"Maleki","sequence":"first","affiliation":[{"name":"Texas State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annie","family":"Yang","sequence":"additional","affiliation":[{"name":"Texas State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"Texas State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.42122"},{"key":"e_1_3_2_1_2_1","volume-title":"John H. Reif (Ed.)","author":"Blelloch G.E.","year":"1990","unstructured":"G.E. Blelloch . \u201c Prefix Sums and Their Applications .\u201d In John H. Reif (Ed.) , Synthesis of Parallel Algorithms, Morgan Kaufmann , 1990 . G.E. Blelloch. \u201cPrefix Sums and Their Applications.\u201d In John H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann, 1990."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/110382.110597"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2790060.2790063"},{"key":"e_1_3_2_1_5_1","unstructured":"CUB\n  : https:\/\/github.com\/NVlabs\/cub  CUB: https:\/\/github.com\/NVlabs\/cub"},{"key":"e_1_3_2_1_6_1","unstructured":"CUDPP\n  : https:\/\/github.com\/cudpp  CUDPP: https:\/\/github.com\/cudpp"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375559"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111041"},{"key":"e_1_3_2_1_9_1","first-page":"25","article-title":"GPU-based Collision Detection for Deformable Parameterized Surfaces","author":"Gre\u00df A.","year":"2006","unstructured":"A. Gre\u00df , M. Guthe , and R. Klein . \u201c GPU-based Collision Detection for Deformable Parameterized Surfaces .\u201d Computer Graphics Forum 25 , 2006 . A. Gre\u00df, M. Guthe, and R. Klein. \u201cGPU-based Collision Detection for Deformable Parameterized Surfaces.\u201d Computer Graphics Forum 25, 2006.","journal-title":"Computer Graphics Forum"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium","author":"Gre\u00df A.","year":"2006","unstructured":"A. Gre\u00df and G. Zachmann . \u201c GPUABiSort: Optimal Parallel Sorting on Stream Architectures .\u201d Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium , 2006 . A. Gre\u00df and G. Zachmann. \u201cGPUABiSort: Optimal Parallel Sorting on Stream Architectures.\u201d Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium, 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339596"},{"key":"e_1_3_2_1_12_1","first-page":"3","article-title":"Parallel prefix sum (scan) with CUDA","author":"Harris M.","year":"2007","unstructured":"M. Harris , S. Sengupta , and J.D. Owens , \u201c Parallel prefix sum (scan) with CUDA .\u201d GPU Gems 3 , 2007 . M. Harris, S. Sengupta, and J.D. Owens, \u201cParallel prefix sum (scan) with CUDA.\u201d GPU Gems 3, 2007.","journal-title":"GPU Gems"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2005.00880.x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/7902.7903"},{"key":"e_1_3_2_1_15_1","volume-title":"Addison Wesley","author":"Horn D.","year":"2005","unstructured":"D. Horn . \u201c Stream reduction operations for GPGPU applications.\u201d In M. Pharr (Ed.), GPU Gems 2, chapter 36, pp. 573\u2013589 . Addison Wesley , 2005 . D. Horn. \u201cStream reduction operations for GPGPU applications.\u201d In M. Pharr (Ed.), GPU Gems 2, chapter 36, pp. 573\u2013589. Addison Wesley, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1098666"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_1_19_1","volume-title":"A performance comparison of sort and scan libraries for GPUs","author":"Merry B.","year":"2014","unstructured":"B. Merry . \u201c A performance comparison of sort and scan libraries for GPUs .\u201d World Scientific Publishing Company , 2014 . B. Merry. \u201cA performance comparison of sort and scan libraries for GPUs.\u201d World Scientific Publishing Company, 2014."},{"key":"e_1_3_2_1_20_1","unstructured":"MGPU\n  : http:\/\/nvlabs.github.io\/moderngpu\/  MGPU: http:\/\/nvlabs.github.io\/moderngpu\/"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024210"},{"key":"e_1_3_2_1_22_1","volume-title":"NVIDIA","author":"Sengupta S.","year":"2008","unstructured":"S. Sengupta , M. Harris , and M. Garland . \u201c Efficient parallel scan algorithms for GPUs .\u201d In NVIDIA , Santa Clara, CA , 2008 - gpucomputing.net. S. Sengupta, M. Harris, and M. Garland. \u201cEfficient parallel scan algorithms for GPUs.\u201d In NVIDIA, Santa Clara, CA, 2008 - gpucomputing.net."},{"key":"e_1_3_2_1_23_1","first-page":"442","volume-title":"Scientific Computing with Multicore and Accelerators","author":"Sengupta S.","year":"2011","unstructured":"S. Sengupta , M. Harris , M. Garland , and J.D. Owens . \u201c Efficient Parallel Scan Algorithms for many-core GPUs \u201d. In J. Kurzak, D.A. Bader, and J. Dongarra (Eds.), Scientific Computing with Multicore and Accelerators , Chapman & amp; Hall\/CRC Computational Science, chapter 19, pp. 413\u2013 442 , 2011 . S. Sengupta, M. Harris, M. Garland, and J.D. Owens. \u201cEfficient Parallel Scan Algorithms for many-core GPUs\u201d. In J. Kurzak, D.A. Bader, and J. Dongarra (Eds.), Scientific Computing with Multicore and Accelerators, Chapman & Hall\/CRC Computational Science, chapter 19, pp. 413\u2013442, 2011."},{"key":"e_1_3_2_1_24_1","first-page":"97","article-title":"Scan primitives for GPU computing","author":"Sengupta S.","year":"2007","unstructured":"S. Sengupta , M. Harris , Y. Zhang , and J.D. Owens . \u201c Scan primitives for GPU computing .\u201d Graphics Hardware 2007 , pp. 97 \u2013 106 , 2007. S. Sengupta, M. Harris, Y. Zhang, and J.D. Owens. \u201cScan primitives for GPU computing.\u201d Graphics Hardware 2007, pp. 97\u2013106, 2007.","journal-title":"Graphics Hardware"},{"key":"e_1_3_2_1_25_1","first-page":"27","volume-title":"Proceedings of the Workshop on Edge Computing Using New Commodity Architectures","author":"Sengupta S.","year":"2006","unstructured":"S. Sengupta , A.E. Lefohn , and J.D. Owens . \u201c A Work-Efficient Step-Efficient Prefix Sum Algorithm .\u201d Proceedings of the Workshop on Edge Computing Using New Commodity Architectures , pp. D-26\u2013 27 , 2006 . S. Sengupta, A.E. Lefohn, and J.D. Owens. \u201cA Work-Efficient Step-Efficient Prefix Sum Algorithm.\u201d Proceedings of the Workshop on Edge Computing Using New Commodity Architectures, pp. D-26\u201327, 2006."},{"key":"e_1_3_2_1_26_1","unstructured":"Thrust: https:\/\/developer.nvidia.com\/thrust  Thrust: https:\/\/developer.nvidia.com\/thrust"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442539"}],"event":{"name":"PLDI '16: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Santa Barbara CA USA","acronym":"PLDI '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908080.2908089","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908080.2908089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:54:49Z","timestamp":1750208089000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908080.2908089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,2]]},"references-count":26,"alternative-id":["10.1145\/2908080.2908089","10.1145\/2908080"],"URL":"https:\/\/doi.org\/10.1145\/2908080.2908089","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2980983.2908089","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,6,2]]},"assertion":[{"value":"2016-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}