{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:51Z","timestamp":1750306971063,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"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":[[2013,11,17]]},"DOI":"10.1145\/2535753.2535762","type":"proceedings-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T13:40:27Z","timestamp":1384868427000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Register level sort algorithm on multi-core SIMD processors"],"prefix":"10.1145","author":[{"given":"Tian","family":"Xiaochen","sequence":"first","affiliation":[{"name":"The University of Tokyo & CREST, JST"}]},{"given":"Kamil","family":"Rocki","sequence":"additional","affiliation":[{"name":"The University of Tokyo & CREST, JST"}]},{"given":"Reiji","family":"Suda","sequence":"additional","affiliation":[{"name":"The University of Tokyo & CREST, JST"}]}],"member":"320","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"issue":"2","key":"e_1_3_2_1_1_1","first-page":"1313","volume":"1","author":"Jatin Chhugan","year":"2008","unstructured":"Jatin Chhugan et al. Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture Proceedings of the VLDB Endowment , Volume 1 Issue 2 , August 2008 , pp. 1313 -- 1324 Jatin Chhugan et al. Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture Proceedings of the VLDB Endowment, Volume 1 Issue 2, August 2008, pp. 1313--1324","journal-title":"Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.202"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161005"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807207"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248436"},{"key":"e_1_3_2_1_8_1","first-page":"219","volume-title":"Volume 3: Sorting and Searching","author":"Knuth The D. E.","year":"1998","unstructured":"D. E. Knuth The Art of Computer Programming , Volume 3: Sorting and Searching , Third Edition. Addison-Wesley , 1998 . ISBN 0-201-89685-0. Section 5.3.4: Networks for Sorting, pp. 219 -- 247 D. E. Knuth The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley, 1998. ISBN 0-201-89685-0. Section 5.3.4: Networks for Sorting, pp. 219--247"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299047"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00223-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142511"},{"key":"e_1_3_2_1_13_1","volume-title":"Radix Tricks: Retrieved Oct 13rd","author":"Herf Michael","year":"2001","unstructured":"Michael Herf , Dec 2001 Radix Tricks: Retrieved Oct 13rd , 2013 from: http:\/\/stereopsis.com\/radix.html Michael Herf, Dec 2001 Radix Tricks: Retrieved Oct 13rd, 2013 from: http:\/\/stereopsis.com\/radix.html"},{"key":"e_1_3_2_1_14_1","volume-title":"Efficient Parallel Merge Sort for Fixed and Variable Length Keys Innovative Parallel Computing(InPar)","author":"Andrew","year":"2012","unstructured":"Andrew Davidson et al . Efficient Parallel Merge Sort for Fixed and Variable Length Keys Innovative Parallel Computing(InPar) , 2012 San Jose, USA Andrew Davidson et al. Efficient Parallel Merge Sort for Fixed and Variable Length Keys Innovative Parallel Computing(InPar), 2012 San Jose, USA"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.05.012"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218014"}],"event":{"name":"SC13: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Denver Colorado","acronym":"SC13"},"container-title":["Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535753.2535762","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535753.2535762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:24Z","timestamp":1750235964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535753.2535762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":15,"alternative-id":["10.1145\/2535753.2535762","10.1145\/2535753"],"URL":"https:\/\/doi.org\/10.1145\/2535753.2535762","relation":{},"subject":[],"published":{"date-parts":[[2013,11,17]]},"assertion":[{"value":"2013-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}