{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:30:14Z","timestamp":1787495414651,"version":"build-2736575974"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819248049","type":"print"},{"value":"9789819248056","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:00:00Z","timestamp":1787529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:00:00Z","timestamp":1787529600000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-4805-6_29","type":"book-chapter","created":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T13:48:12Z","timestamp":1787492892000},"page":"436-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TL-Sort: A Fully Pipelined Hardware Architecture for\u00a0Sorting Without Run-Drain Stalls"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7091-6329","authenticated-orcid":false,"given":"Hai","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7165-9297","authenticated-orcid":false,"given":"Puguang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4388-4635","authenticated-orcid":false,"given":"Jihang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingyun","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingche","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,24]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Casper, J., Olukotun, K.: Hardware acceleration of database operations. In: Proceedings of ACM\/SIGDA International Symposium on Field-Program. Gate Arrays (FPGA), pp. 151\u2013160 (2014)","DOI":"10.1145\/2554688.2554787"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Dong, B., Byna, S., Wu, K.: SDS-Sort: Scalable Dynamic Skew-aware Parallel Sorting. In: Proceedings of 25th ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC), pp. 57\u201368 (2016)","DOI":"10.1145\/2907294.2907300"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Zhu, H., Lo, D., Cheng, L., Govindaraju, R., Ranganathan, P., Erez, M.: Kelp: QoS for accelerated machine learning systems. In: Proceedings of International Symposium on High Performance Computer Architecture (HPCA) (2019)","DOI":"10.1109\/HPCA.2019.00036"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Song, W., Koch, D., Luj\u00e1n, M., Garside, J.: Parallel Hardware Merge Sorter. In: Proceedings of IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), pp. 95\u2013102. Washington, DC (2016)","DOI":"10.1109\/FCCM.2016.34"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Usui, T., Chu, T.V., Kise, K.: A Cost-Effective and Scalable Merge Sorter Tree on FPGAs. In: Proceedings of International Symposium on Computerised Networks (CANDAR), pp. 47\u201356 (2016)","DOI":"10.1109\/CANDAR.2016.0023"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Samardzic, N., Qiao, W., Aggarwal, V., Chang, M.-C.F., Cong, J.: Bonsai: High-Performance Adaptive Merge Tree Sorting. In: Proceedings of ACM\/IEEE 47th Annual International Symposium on Computerised Architecture (ISCA), pp. 282\u2013294. Valencia, Spain (2020)","DOI":"10.1109\/ISCA45697.2020.00033"},{"key":"29_CR7","first-page":"766","volume":"30","author":"R Kobayashi","year":"2022","unstructured":"Kobayashi, R., Miura, K., Fujita, N., et al.: An Open-Source FPGA Library for Data Sorting. J. Inf. Process. 30, 766\u2013777 (2022)","journal-title":"J. Inf. Process."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Jayaraman, S., Zhang, B., Prasanna, V.: Hypersort: High-Performance Parallel Sorting on HBM-Enabled FPGA. In: Proceedings of International Conference on Field-Programmable Technology (FPT), pp. 1\u201311. Hong Kong, China (2022)","DOI":"10.1109\/ICFPT56656.2022.9974209"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Qiao, W., Guo, L., Fang, Z., Chang, M.-C.F., Cong, J.: TopSort: a high-performance two-phase sorting accelerator optimized on HBM-based FPGAs. IEEE Trans. Emerg. Top. Comput. 404\u2013419 (2023)","DOI":"10.1109\/TETC.2022.3228575"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Sun, M., Xie, G., Zhang, F., Guo, W., Fan, X., Chen, L., Du, J.: FPGA-Based Large-Scale Sorting with Optimized Bandwidth Utilization. ACM Trans. Reconfigurable Technol. Syst. (2025)","DOI":"10.1145\/3716392"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Liu, J., Li, Y., Huang, Z., Chen, C., Chen, R., da Silva, B.: FASE: An FPGA-based accelerator for lightweight sample entropy with Monte Carlo sampling. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 33(10), 2883\u20132896 (2025)","DOI":"10.1109\/TVLSI.2025.3593020"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Saitoh, M., Kise, K.: Very Massive Hardware Merge Sorter. In: Proceedings of International Conference on Field-Programming Technology (FPT), pp. 86\u201393 (2018)","DOI":"10.1109\/FPT.2018.00023"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting Networks and Their Applications. In: Proceedings of Joint Computing Conference AFIPS, pp. 307\u2013314 (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"29_CR14","unstructured":"Knuth, D.E.: Sorting and Searching. In: The Art of Computer Programming, vol. 3, 2nd edn. Addison-Wesley, Reading, MA (1998)"},{"issue":"12","key":"29_CR15","first-page":"3215","volume":"71","author":"P Papaphilippou","year":"2022","unstructured":"Papaphilippou, P., Luk, W., Brooks, C.: FLiMS: A Fast Lightweight 2-Way Merger for Sorting. IEEE Trans. Comput. 71(12), 3215\u20133226 (2022)","journal-title":"IEEE Trans. Comput."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Saitoh, M., Elsayed, E.A., Chu, T.V., Mashimo, S., Kise, K.: A High-Performance and Cost-Effective Hardware Merge Sorter Without Feedback Datapath. In: Proceedings of IEEE 26th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), pp. 197\u2013204 (2018)","DOI":"10.1109\/FCCM.2018.00038"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Papaphilippou, P., Brooks, C., Luk, W.: An Adaptable High-Throughput FPGA Merge Sorter for Accelerating Database Analytics. In: Proceedings of 30th International Conference on Field-Programmable Logic and Applications(FPL), pp. 65\u201372 (2020)","DOI":"10.1109\/FPL50879.2020.00021"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Oh, H.-W., Park, J., Lee, S.E.: DL-Sort: a hybrid approach to scalable hardware-accelerated fully streaming sorting. IEEE Trans. Circ. Syst. II, Exp. Briefs 71, 2549\u20132553 (2024)","DOI":"10.1109\/TCSII.2024.3377255"}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-4805-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T13:48:15Z","timestamp":1787492895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-4805-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,24]]},"ISBN":["9789819248049","9789819248056"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-4805-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,24]]},"assertion":[{"value":"24 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"Artificial intelligence tools, if used, were used only for language organization and figure\/table polishing, and did not participate in the generation of the core ideas or technical content.","order":2,"name":"Ethics","label":"Artificial Intelligence Statement","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"APPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Advanced Parallel Processing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"appt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.appt-conference.com\/2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}