{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:02:35Z","timestamp":1754485355555,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819615506"},{"type":"electronic","value":"9789819615513"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1551-3_3","type":"book-chapter","created":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T09:09:23Z","timestamp":1739696963000},"page":"26-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Vectorized Merge Sort on\u00a0ARM NEON"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2281-0767","authenticated-orcid":false,"given":"Jincheng","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7464-2247","authenticated-orcid":false,"given":"Jin","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5201-3802","authenticated-orcid":false,"given":"Xiang","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8378-5530","authenticated-orcid":false,"given":"Tiaojie","family":"Xiao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5794-7906","authenticated-orcid":false,"given":"Di","family":"Ma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4825-4686","authenticated-orcid":false,"given":"Chunye","family":"Gong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"3_CR1","unstructured":"Boost.sort 3.-Parallel Algorithms (2021). https:\/\/www.boost.org\/doc\/libs\/develop\/libs\/sort\/doc\/html\/sort\/parallel.html"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.14778\/3489496.3489507","volume":"15","author":"A Arman","year":"2021","unstructured":"Arman, A., Loguinov, D.: Origami: a high-performance mergesort framework. Proc. VLDB Endow. 15, 259\u2013271 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bramas, B.: A fast vectorized sorting implementation based on the arm scalable vector extension (sve). PeerJ Comput. Sci. 7 (2021)","DOI":"10.7717\/peerj-cs.769"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Christensen, P., Fong, J., Renderman, S., et al.: An advanced path-tracing architecture for movie rendering. ACM Trans. Graph. 37(3) (2018)","DOI":"10.1145\/3182162"},{"key":"3_CR5","unstructured":"Gamble, J.M.: Sorting network generator (2019). http:\/\/pages.ripco.net\/~jgamble\/nw.html"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Inoue, H., Moriyama, T., Komatsu, H., et\u00a0al.: Aa-sort: A new parallel sorting algorithm for multi-core SIMD processors. In: 16th International Conference on Parallel Architecture and Compilation Techniques, pp. 189\u2013198 (2007)","DOI":"10.1109\/PACT.2007.4336211"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Kobayashi, R., Kise, K.: A high performance FPGA-based sorting accelerator with a data compression mechanism. IEICE Trans. Inf. Syst. 100-D, 1003\u20131015 (2017)","DOI":"10.1587\/transinf.2016EDP7383"},{"key":"3_CR8","first-page":"1004","volume":"51","author":"J Marianczuk","year":"2019","unstructured":"Marianczuk, J.: Engineering faster sorters for small sets of items. Softw. Pract. Exp. 51, 1004\u2013965 (2019)","journal-title":"Softw. Pract. Exp."},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/356593.356594","volume":"3","author":"WA Martin","year":"1971","unstructured":"Martin, W.A.: Sorting. ACM Comput. Surv. 3(4), 147\u2013174 (1971)","journal-title":"ACM Comput. Surv."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Odeh, S., Green, O., Mwassi, Z., et\u00a0al.: Merge path - parallel merging made simple. In: IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp. 1611\u20131618 (2012)","DOI":"10.1109\/IPDPSW.2012.202"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Satish, N., Kim, C., Chhugani, J., et\u00a0al.: Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2010)","DOI":"10.1145\/1807167.1807207"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Yin, Z., Zhang, T., M\u00fcller, A., et\u00a0al.: Efficient parallel sort on AVX-512-based multi-core and many-core architectures. In: IEEE International Conference on High Performance Computing and Communications, pp. 168\u2013176 (2019)","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00038"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1551-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T09:09:33Z","timestamp":1739696973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1551-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819615506","9789819615513"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1551-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ica3pp2024.scimeeting.cn\/en\/web\/index\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}