{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:26:02Z","timestamp":1775744762141,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["MISU F 6001 1"],"award-info":[{"award-number":["MISU F 6001 1"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1533823,CCF-1745331,CCF-1319648,CCF-1533564,CCF-0430849"],"award-info":[{"award-number":["CCF-1533823,CCF-1745331,CCF-1319648,CCF-1533564,CCF-0430849"]}],"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,6,12]]},"DOI":"10.1145\/3205289.3205298","type":"proceedings-article","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T12:54:52Z","timestamp":1536843292000},"page":"86-95","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs"],"prefix":"10.1145","author":[{"given":"Ben","family":"Karsin","sequence":"first","affiliation":[{"name":"University of Hawaii at M\u0101noa, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Weichert","sequence":"additional","affiliation":[{"name":"Goethe University Frankfurt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri","family":"Casanova","sequence":"additional","affiliation":[{"name":"University of Hawaii at M\u0101noa, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[{"name":"New York University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nodari","family":"Sitchinava","sequence":"additional","affiliation":[{"name":"University of Hawaii at M\u0101noa, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Baxter. Modern GPU. URL: http:\/\/nvlabs.github.io\/moderngpu\/.  S. Baxter. Modern GPU. URL: http:\/\/nvlabs.github.io\/moderngpu\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"de Berg Mark","year":"2008","unstructured":"Mark de Berg , Otfried Cheong , Marc van Kreveld , and Mark Overmars . Computational Geometry: Algorithms and Applications . Springer-Verlag TELOS , Santa Clara, CA, USA , 3 rd ed. edition, 2008 . Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS, Santa Clara, CA, USA, 3rd ed. edition, 2008.","edition":"3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2971808.2972104"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555253"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"2001","unstructured":"Thomas H. Cormen , Clifford Stein , Ronald L. Rivest , and Charles E. Leiserson . Introduction to Algorithms . McGraw-Hill , 2 nd edition, 2001 . Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. Introduction to Algorithms. McGraw-Hill, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_8_1","volume-title":"Deterministic sample sort for GPUs. CoRR, abs\/1002.4464","author":"Dehne Frank","year":"2010","unstructured":"Frank Dehne and Hamidreza Zaboli . Deterministic sample sort for GPUs. CoRR, abs\/1002.4464 , 2010 . Frank Dehne and Hamidreza Zaboli. Deterministic sample sort for GPUs. CoRR, abs\/1002.4464, 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375559"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2384047"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2738600.2738603"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304621"},{"key":"e_1_3_2_1_13_1","volume-title":"Merge path - A visually intuitive approach to parallel merging. CoRR, abs\/1406.2628","author":"Green Oded","year":"2014","unstructured":"Oded Green , Saher Odeh , and Yitzhak Birk . Merge path - A visually intuitive approach to parallel merging. CoRR, abs\/1406.2628 , 2014 . Oded Green, Saher Odeh, and Yitzhak Birk. Merge path - A visually intuitive approach to parallel merging. CoRR, abs\/1406.2628, 2014."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646340.686429"},{"key":"e_1_3_2_1_15_1","volume-title":"Thrust: A parallel template library","author":"Hoberock Jared","year":"2010","unstructured":"Jared Hoberock and Nathan Bell . Thrust: A parallel template library , 2010 . Version 1.7.0. URL : http:\/\/thrust.github.io\/. Jared Hoberock and Nathan Bell. Thrust: A parallel template library, 2010. Version 1.7.0. URL: http:\/\/thrust.github.io\/."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555775"},{"key":"e_1_3_2_1_17_1","first-page":"232","volume":"2","author":"Kaczmarski K.","year":"2011","unstructured":"K. Kaczmarski . Experimental B+-tree for GPU. In Proc . of ADBIS , volume 2 , pages 232 -- 241 , Rome, Italy, 2011 . K. Kaczmarski. Experimental B+-tree for GPU. In Proc. of ADBIS, volume 2, pages 232--241, Rome, Italy, 2011.","journal-title":"of ADBIS"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2015.40"},{"key":"e_1_3_2_1_20_1","volume-title":"Inc.","author":"Knuth Donald E.","year":"1998","unstructured":"Donald E. Knuth . The Art of Computer Programming, Volume 3: (2nd Ed.) Sorting and Searching. Addison Wesley Publishing Co ., Inc. , 1998 . Donald E. Knuth. The Art of Computer Programming, Volume 3: (2nd Ed.) Sorting and Searching. Addison Wesley Publishing Co., Inc., 1998."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.5.1_26"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2009.5433179"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470444"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2014.6868641"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2747903.2748175"},{"key":"e_1_3_2_1_26_1","unstructured":"D. Merrill. CUB: CUDA Unbound. URL: http:\/\/nvlabs.github.io\/cub\/.  D. Merrill. CUB: CUDA Unbound. URL: http:\/\/nvlabs.github.io\/cub\/."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854344"},{"key":"e_1_3_2_1_29_1","first-page":"4","article-title":"A performance comparison of sort and scan libraries for GPUs","author":"Merry Bruce","year":"2016","unstructured":"Bruce Merry . A performance comparison of sort and scan libraries for GPUs . Parallel Processing Letters , 4 , 2016 . Bruce Merry. A performance comparison of sort and scan libraries for GPUs. Parallel Processing Letters, 4, 2016.","journal-title":"Parallel Processing Letters"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.98"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.17"},{"key":"e_1_3_2_1_32_1","unstructured":"NVIDIA. Nsight 2015. URL: http:\/\/nvidia.com\/object\/nsight.html.  NVIDIA. Nsight 2015. URL: http:\/\/nvidia.com\/object\/nsight.html."},{"key":"e_1_3_2_1_33_1","volume-title":"CUDA guide 9.0","author":"NVIDIA.","year":"2017","unstructured":"NVIDIA. CUDA guide 9.0 , 2017 . URL : http:\/\/docs.nvidia.com\/cuda. NVIDIA. CUDA guide 9.0, 2017. URL: http:\/\/docs.nvidia.com\/cuda."},{"key":"e_1_3_2_1_34_1","volume-title":"CUDA cuBLAS library","author":"NVIDIA.","year":"2018","unstructured":"NVIDIA. CUDA cuBLAS library , 2018 . URL : http:\/\/docs.nvidia.com\/cuda\/cublas\/. NVIDIA. CUDA cuBLAS library, 2018. URL: http:\/\/docs.nvidia.com\/cuda\/cublas\/."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345220"},{"key":"e_1_3_2_1_37_1","first-page":"176","volume-title":"Proc. of IMKE","author":"Shekhar A.","year":"2013","unstructured":"A. Shekhar . Parallel binary search trees for rapid IP lookup using graphic processors . In Proc. of IMKE , pages 176 -- 179 , 2013 . A. Shekhar. Parallel binary search trees for rapid IP lookup using graphic processors. In Proc. of IMKE, pages 176--179, 2013."},{"key":"e_1_3_2_1_38_1","volume-title":"Provably efficient GPU algorithms. CoRR, abs\/1306.5076","author":"Sitchinava Nodari","year":"2013","unstructured":"Nodari Sitchinava and Volker Weichert . Provably efficient GPU algorithms. CoRR, abs\/1306.5076 , 2013 . Nodari Sitchinava and Volker Weichert. Provably efficient GPU algorithms. CoRR, abs\/1306.5076, 2013."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133803.2345679"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2010.5452013"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014698.2014875"}],"event":{"name":"ICS '18: 2018 International Conference on Supercomputing","location":"Beijing China","acronym":"ICS '18","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 2018 International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205289.3205298","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205289.3205298","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205289.3205298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:33Z","timestamp":1750208913000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205289.3205298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":38,"alternative-id":["10.1145\/3205289.3205298","10.1145\/3205289"],"URL":"https:\/\/doi.org\/10.1145\/3205289.3205298","relation":{},"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"2018-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}