{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:59:44Z","timestamp":1762606784656,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T00:00:00Z","timestamp":1464652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DOE Office of Science, Advanced Scientific Computing Research","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,31]]},"DOI":"10.1145\/2907294.2907300","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T19:23:42Z","timestamp":1464895422000},"page":"57-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["SDS-Sort"],"prefix":"10.1145","author":[{"given":"Bin","family":"Dong","sequence":"first","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}]},{"given":"Surendra","family":"Byna","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}]},{"given":"Kesheng","family":"Wu","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1088\/0004-637X\/765\/1\/39"},{"key":"e_1_3_2_1_2_1","volume-title":"USA","author":"Amato N.","year":"1998","unstructured":"N. Amato , R. Iyer , S. Sundaresan , and Y. Wu . A comparison of parallel sorting algorithms on different architectures. Technical report, TX , USA , 1998 . N. Amato, R. Iyer, S. Sundaresan, and Y. Wu. A comparison of parallel sorting algorithms on different architectures. Technical report, TX, USA, 1998."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/792548.611918"},{"key":"e_1_3_2_1_4_1","volume-title":"USA","author":"Bilardi G.","year":"1986","unstructured":"G. Bilardi and A. Nicolau . Adaptive bitonic sorting: An optimal parallel algorithm for shared memory machines. Technical report, Ithaca, NY , USA , 1986 . G. Bilardi and A. Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared memory machines. Technical report, Ithaca, NY, USA, 1986."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1086\/668468"},{"key":"e_1_3_2_1_6_1","volume-title":"Cray XC (R) Series Network. Technical report","author":"Bob Alverson L. K.","year":"2012","unstructured":"L. K. Bob Alverson , Edwin Froese and D. Roweth . Cray XC (R) Series Network. Technical report , Cray Inc ., 2012 . L. K. Bob Alverson, Edwin Froese and D. Roweth. Cray XC (R) Series Network. Technical report, Cray Inc., 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807271"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791889.1791927"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593662"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1097"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2013.6702675"},{"key":"e_1_3_2_1_13_1","volume-title":"April","author":"Ebert A.","year":"2013","unstructured":"A. Ebert . Ntosort. Technical report , April , 2013 . A. Ebert. Ntosort. Technical report, April, 2013."},{"key":"e_1_3_2_1_14_1","volume-title":"VLDB'96","author":"Faloutsos C.","year":"1996","unstructured":"C. Faloutsos , Y. Matias , and A. Silberschatz . Modeling skewed distribution using multifractals and the 80-20 law . In VLDB'96 , Proceedings of 22th International Conference on Very Large Data Bases , September 3-6, 1996 , Mumbai (Bombay), India, pages 307--317, 1996. C. Faloutsos, Y. Matias, and A. Silberschatz. Modeling skewed distribution using multifractals and the 80-20 law. In VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India, pages 307--317, 1996."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321600"},{"key":"e_1_3_2_1_16_1","volume-title":"Using MPI-2: Advanced Features of the Message Passing Interface","author":"Gropp W.","year":"1999","unstructured":"W. Gropp , R. Thakur , and E. Lusk . Using MPI-2: Advanced Features of the Message Passing Interface . MIT Press , Cambridge, MA, USA , 2 nd edition, 1999 . W. Gropp, R. Thakur, and E. Lusk. Using MPI-2: Advanced Features of the Message Passing Interface. MIT Press, Cambridge, MA, USA, 2nd edition, 1999.","edition":"2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2386208.2386210"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213965"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90019-H"},{"key":"e_1_3_2_1_20_1","volume-title":"pareto distributions and zipf#226","author":"Newman M. E. J.","year":"2005","unstructured":"M. E. J. Newman . Power laws , pareto distributions and zipf#226 ; A-Zs law. Contemporary Physics , 2005 . M. E. J. Newman. Power laws, pareto distributions and zipf#226; A-Zs law. Contemporary Physics, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807616"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2427631.2427634"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359631"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470406"},{"key":"e_1_3_2_1_25_1","volume-title":"The cosmological simulation code GADGET-2. Technical report","author":"Springel V.","year":"2005","unstructured":"V. Springel . The cosmological simulation code GADGET-2. Technical report , 2005 . V. Springel. The cosmological simulation code GADGET-2. Technical report, 2005."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1765(95)00696-D"},{"key":"e_1_3_2_1_27_1","volume-title":"The C++ Programming Language","author":"Stroustrup B.","year":"2000","unstructured":"B. Stroustrup . The C++ Programming Language . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 3 rd edition, 2000 . B. Stroustrup. The C++ Programming Language. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 3rd edition, 2000.","edition":"3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465442"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503259"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/SUPERC.1992.236714","volume-title":"Supercomputing '92","author":"Thearling K.","year":"1992","unstructured":"K. Thearling and S. Smith . An improved supercomputer sorting benchmark . In Supercomputing '92 , pages 14 -- 19 , Los Alamitos, CA , USA, 1992 . IEEE Computer Society Press K. Thearling and S. Smith. An improved supercomputer sorting benchmark. In Supercomputing '92, pages 14--19, Los Alamitos, CA, USA, 1992. IEEE Computer Society Press"}],"event":{"name":"HPDC'16: The 25th International Symposium on High-Performance Parallel and Distributed Computing","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Kyoto Japan","acronym":"HPDC'16"},"container-title":["Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907294.2907300","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2907294.2907300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:25Z","timestamp":1750222465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907294.2907300"}},"subtitle":["Scalable Dynamic Skew-aware Parallel Sorting"],"short-title":[],"issued":{"date-parts":[[2016,5,31]]},"references-count":30,"alternative-id":["10.1145\/2907294.2907300","10.1145\/2907294"],"URL":"https:\/\/doi.org\/10.1145\/2907294.2907300","relation":{},"subject":[],"published":{"date-parts":[[2016,5,31]]},"assertion":[{"value":"2016-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}