{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:27Z","timestamp":1750220307751,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,28]]},"DOI":"10.1145\/3503222.3507728","type":"proceedings-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T20:49:01Z","timestamp":1645562941000},"page":"669-682","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A one-for-all and\n            <i>o<\/i>\n            (\n            <i>v<\/i>\n            log(\n            <i>v<\/i>\n            ))-cost solution for parallel merge style operations on sorted key-value arrays"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5240-7238","authenticated-orcid":false,"given":"Bangyan","family":"Wang","sequence":"first","affiliation":[{"name":"University of California at Santa Barbara, USA"}]},{"given":"Lei","family":"Deng","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"given":"Fei","family":"Sun","sequence":"additional","affiliation":[{"name":"Alibaba DAMO Academy, China"}]},{"given":"Guohao","family":"Dai","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0792-8146","authenticated-orcid":false,"given":"Liu","family":"Liu","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"given":"Yuan","family":"Xie","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. Eigen is a C++ template library for linear algebra: matrices vectors numerical solvers and related algorithms. https:\/\/eigen.tuxfamily.org\/index.ph p?title=MainPage."},{"key":"e_1_3_2_1_2_1","unstructured":"[n. d.]. FlexMiner: A Pattern-Aware Accelerator for Graph Pattern Mining. ([n. d.])."},{"key":"e_1_3_2_1_3_1","unstructured":"[n. d.]. Intel Intrinsics Guide. https:\/\/software.intel.com\/sites\/landingpage\/Intri nsicsGuide\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_5_1","unstructured":"Benjamin Schlegel Thomas Willhalm Wolfgang Lehner. [n. d.]. Fast Sorted-Set Intersection using SIMD Instructions. ([n. d.])."},{"key":"e_1_3_2_1_6_1","unstructured":"Maciej Besta zur Vonarburg-Shmaria Yannick Schafner Leonardo Schwarz Grzegorz Kwasniewski Lukas Gianinazzi Jakub Beranek Kacper Janda Tobias Holenstein Sebastian Leisinger Peter Tatkowski Esref Ozdemir Adrian Balla Marcin Copik Philipp Lindenberger Pavel Kalvoda Marek Konieczny Onur Mutlu and Torsten Hoefler. [n. d.]. GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra. https:\/\/arxiv.or g\/pdf\/2103.03653"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"B\u00e9renger Bramas. 2021. A fast vectorized sorting implementation based on the ARM scalable vector extension (SVE). ArXiv abs\/2105.07782 ( 2021 ).","DOI":"10.7717\/peerj-cs.769"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554688.2554787"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/130948811"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196924"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358275"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00017"},{"key":"e_1_3_2_1_14_1","unstructured":"Hiroshi Inoue. [n. d.]. Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions. ([n. d.])."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809988"},{"key":"e_1_3_2_1_16_1","unstructured":"J.-F. Zhang C.-E. Lee C. Liu Y. S. Shao and S. W. Keckler and Z. Zhang. [n. d.]. C24-4 SNAP: A 1. 67-21.55TOPS\/ W Sparse Neural Acceleration Processor for Unstructured Sparse Deep Neural Network Inference in 16nm CMOS. ([n. d.])."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229710.3229720"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00081"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807207"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266"},{"key":"e_1_3_2_1_22_1","unstructured":"Sungju Ryu Youngtaek Oh Taesu Kim Daehyun Ahn and Jae-Joon Kim. [n. d.]. SPRITE: Sparsity-Aware Neural Processing Unit with Constant Probability of Index-Matching. ([n. d.])."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446702"},{"key":"e_1_3_2_1_24_1","unstructured":"Zhekai Zhang Hanrui Wang Song Han and William J. Dally. [n. d.]. SpArch: Eficient Architecture for Sparse Matrix Multiplication. https:\/\/arxiv.org\/pdf\/20 02.08947"}],"event":{"name":"ASPLOS '22: 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Lausanne Switzerland","acronym":"ASPLOS '22"},"container-title":["Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503222.3507728","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503222.3507728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:39Z","timestamp":1750191099000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503222.3507728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":24,"alternative-id":["10.1145\/3503222.3507728","10.1145\/3503222"],"URL":"https:\/\/doi.org\/10.1145\/3503222.3507728","relation":{},"subject":[],"published":{"date-parts":[[2022,2,22]]},"assertion":[{"value":"2022-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}