{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:57:59Z","timestamp":1760821079573,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Office of Advanced Cyberinfrastructure","award":["1550554"],"award-info":[{"award-number":["1550554"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323184","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"201-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Histogram Sort with Sampling"],"prefix":"10.1145","author":[{"given":"Vipul","family":"Harsh","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Laxmikant","family":"Kale","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Edgar","family":"Solomonik","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Bilge Acun Abhishek Gupta Nikhil Jain Akhil Langer Harshitha Menon Eric Mikida Xiang Ni Michael Robson Yanhua Sun Ehsan Totoni etal 2014. Parallel programming with migratable objects: charm  Bilge Acun Abhishek Gupta Nikhil Jain Akhil Langer Harshitha Menon Eric Mikida Xiang Ni Michael Robson Yanhua Sun Ehsan Totoni et al. 2014. Parallel programming with migratable objects: charm","DOI":"10.1109\/SC.2014.58"},{"volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 647--658","key":"e_1_3_2_1_2_1","unstructured":"in practice. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 647--658 . in practice. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 647--658."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755595"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755604"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113380"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000083"},{"key":"e_1_3_2_1_11_1","unstructured":"David R Cheng Alan Edelman John R Gilbert and Viral Shah. 2006. A novel parallel sorting algorithm for contemporary architectures. (2006).  David R Cheng Alan Edelman John R Gilbert and Viral Shah. 2006. A novel parallel sorting algorithm for contemporary architectures. (2006)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321600"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/333115.333120"},{"key":"e_1_3_2_1_16_1","volume-title":"Histogram Sort with Sampling. CoRR","author":"Harsh Vipul","year":"2018","unstructured":"Vipul Harsh , Laxmikant V. Kal\u00e9 , and Edgar Solomonik . 2018. Histogram Sort with Sampling. CoRR , Vol. abs\/ 1803 .01237 ( 2018 ). arxiv: 1803.01237 http:\/\/arxiv.org\/abs\/1803.01237 Vipul Harsh, Laxmikant V. Kal\u00e9, and Edgar Solomonik. 2018. Histogram Sort with Sampling. CoRR, Vol. abs\/1803.01237 (2018). arxiv: 1803.01237 http:\/\/arxiv.org\/abs\/1803.01237"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/297096.297128"},{"key":"e_1_3_2_1_18_1","unstructured":"JS Huang and YC Chow. 1983. Parallel sorting and data partitioning by sampling. (1983).  JS Huang and YC Chow. 1983. Parallel sorting and data partitioning by sampling. (1983)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536319"},{"volume-title":"a portable concurrent object oriented system based on C+","author":"Kale Laxmikant V","key":"e_1_3_2_1_20_1","unstructured":"Laxmikant V Kale and Sanjeev Krishnan . 1993. CHARM+ : a portable concurrent object oriented system based on C+ . Vol. 28 . ACM. Laxmikant V Kale and Sanjeev Krishnan. 1993. CHARM+: a portable concurrent object oriented system based on C+. Vol. 28. ACM."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.17"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/181014.192329"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90019-H"},{"key":"e_1_3_2_1_24_1","unstructured":"Owen O'Malley. 2008. Terabyte sort on apache hadoop. Yahoo http:\/\/sortbenchmark.org\/YahooHadoop.pdf (2008) 1--3.  Owen O'Malley. 2008. Terabyte sort on apache hadoop. Yahoo http:\/\/sortbenchmark.org\/YahooHadoop.pdf (2008) 1--3."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840378"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-007-0012-0"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90075-X"},{"volume-title":"Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). 1--12","author":"Solomonik E.","key":"e_1_3_2_1_28_1","unstructured":"E. Solomonik and L. V. Kale . 2010. Highly scalable parallel sorting . In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). 1--12 . E. Solomonik and L. V. Kale. 2010. Highly scalable parallel sorting. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). 1--12."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465442"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39924-7_38"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":29,"alternative-id":["10.1145\/3323165.3323184","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323184","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}