{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:01:38Z","timestamp":1775692898948,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U19B2019, U21B2031, 61832007, 62104128"],"award-info":[{"award-number":["U19B2019, U21B2031, 61832007, 62104128"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,28]]},"DOI":"10.1145\/3613424.3614292","type":"proceedings-article","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T17:22:15Z","timestamp":1702056135000},"page":"283-296","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["DF-GAS: a Distributed FPGA-as-a-Service Architecture towards Billion-Scale Graph-based Approximate Nearest Neighbor Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1030-3748","authenticated-orcid":false,"given":"Shulin","family":"Zeng","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9259-7180","authenticated-orcid":false,"given":"Zhenhua","family":"Zhu","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8280-9072","authenticated-orcid":false,"given":"Jun","family":"Liu","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3889-8688","authenticated-orcid":false,"given":"Haoyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0849-3252","authenticated-orcid":false,"given":"Guohao","family":"Dai","sequence":"additional","affiliation":[{"name":"Qingyuan Research Institute, Shanghai Jiao Tong University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3817-1862","authenticated-orcid":false,"given":"Zixuan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6986-0463","authenticated-orcid":false,"given":"Shuangchen","family":"Li","sequence":"additional","affiliation":[{"name":"DAMO Academy, Alibaba Group, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2209-8312","authenticated-orcid":false,"given":"Xuefei","family":"Ning","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2093-1788","authenticated-orcid":false,"given":"Yuan","family":"Xie","sequence":"additional","affiliation":[{"name":"DAMO Academy, Alibaba Group, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2421-353X","authenticated-orcid":false,"given":"Huazhong","family":"Yang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6108-5157","authenticated-orcid":false,"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,12,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2022. hnswlib. [Online]. https:\/\/github.com\/nmslib\/hnswlib.  2022. hnswlib. [Online]. https:\/\/github.com\/nmslib\/hnswlib."},{"key":"e_1_3_2_1_2_1","unstructured":"2022. SPACEV datasets. [Online]. https:\/\/github.com\/microsoft\/SPTAG\/tree\/main\/datasets\/SPACEV1B.  2022. SPACEV datasets. [Online]. https:\/\/github.com\/microsoft\/SPTAG\/tree\/main\/datasets\/SPACEV1B."},{"key":"e_1_3_2_1_3_1","unstructured":"2022. Xilinx Board Utility Tool. [Online]. https:\/\/xilinx.github.io\/XRT\/2021.1\/html\/xbutil2.html.  2022. Xilinx Board Utility Tool. [Online]. https:\/\/xilinx.github.io\/XRT\/2021.1\/html\/xbutil2.html."},{"key":"e_1_3_2_1_4_1","unstructured":"2022. Xup vitis network example (vnx). [Online]. https: \/\/github.com\/Xilinx\/xup_vitis_network_example.  2022. Xup vitis network example (vnx). [Online]. https: \/\/github.com\/Xilinx\/xup_vitis_network_example."},{"key":"e_1_3_2_1_5_1","volume-title":"2019 International Conference on Field-Programmable Technology (ICFPT). IEEE, 90\u201398","author":"Abdelhadi MS","year":"2019","unstructured":"Ameer\u00a0 MS Abdelhadi , Christos-Savvas Bouganis , and George\u00a0 A Constantinides . 2019 . Accelerated approximate nearest neighbors search through hierarchical product quantization . In 2019 International Conference on Field-Programmable Technology (ICFPT). IEEE, 90\u201398 . Ameer\u00a0MS Abdelhadi, Christos-Savvas Bouganis, and George\u00a0A Constantinides. 2019. Accelerated approximate nearest neighbors search through hierarchical product quantization. In 2019 International Conference on Field-Programmable Technology (ICFPT). IEEE, 90\u201398."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"e_1_3_2_1_7_1","first-page":"5199","article-title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search","volume":"34","author":"Chen Qi","year":"2021","unstructured":"Qi Chen , Bing Zhao , Haidong Wang , Mingqin Li , Chuanjie Liu , Zengzhong Li , Mao Yang , and Jingdong Wang . 2021 . SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search . Advances in Neural Information Processing Systems 34 (2021), 5199 \u2013 5212 . Qi Chen, Bing Zhao, Haidong Wang, Mingqin Li, Chuanjie Liu, Zengzhong Li, Mao Yang, and Jingdong Wang. 2021. SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search. Advances in Neural Information Processing Systems 34 (2021), 5199\u20135212.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 20th annual symposium on Computational geometry. 253\u2013262","author":"Datar Mayur","year":"2004","unstructured":"Mayur Datar , Nicole Immorlica , Piotr Indyk , and Vahab\u00a0 S Mirrokni . 2004 . Locality-sensitive hashing scheme based on p-stable distributions . In Proceedings of the 20th annual symposium on Computational geometry. 253\u2013262 . Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab\u00a0S Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the 20th annual symposium on Computational geometry. 253\u2013262."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1988.754602"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_14_1","volume-title":"Ggnn: Graph-based gpu nearest neighbor search","author":"Groh Fabian","year":"2022","unstructured":"Fabian Groh , Lukas Ruppert , Patrick Wieschollek , and Hendrik Lensch . 2022 . Ggnn: Graph-based gpu nearest neighbor search . IEEE Transactions on Big Data ( 2022). Fabian Groh, Lukas Ruppert, Patrick Wieschollek, and Hendrik Lensch. 2022. Ggnn: Graph-based gpu nearest neighbor search. IEEE Transactions on Big Data (2022)."},{"key":"e_1_3_2_1_15_1","volume-title":"International Conference on Machine Learning. PMLR, 3887\u20133896","author":"Guo Ruiqi","year":"2020","unstructured":"Ruiqi Guo , Philip Sun , Erik Lindgren , Quan Geng , David Simcha , Felix Chern , and Sanjiv Kumar . 2020 . Accelerating large-scale inference with anisotropic vector quantization . In International Conference on Machine Learning. PMLR, 3887\u20133896 . Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In International Conference on Machine Learning. PMLR, 3887\u20133896."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 5713\u20135722","author":"Harwood Ben","year":"2016","unstructured":"Ben Harwood and Tom Drummond . 2016 . Fanng: Fast approximate nearest neighbour graphs . In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 5713\u20135722 . Ben Harwood and Tom Drummond. 2016. Fanng: Fast approximate nearest neighbour graphs. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 5713\u20135722."},{"key":"e_1_3_2_1_18_1","volume-title":"Third International Workshop on Hardware\/Software Codesign. IEEE, 81\u201388","author":"Hoeg Flemming","year":"1994","unstructured":"Flemming Hoeg , Niels Mellergaard , and J\u00f8rgen Staunstrup . 1994 . The priority queue as an example of hardware\/software codesign . In Third International Workshop on Hardware\/Software Codesign. IEEE, 81\u201388 . Flemming Hoeg, Niels Mellergaard, and J\u00f8rgen Staunstrup. 1994. The priority queue as an example of hardware\/software codesign. In Third International Workshop on Hardware\/Software Codesign. IEEE, 81\u201388."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_3_2_1_20_1","volume-title":"Systems & Software. In 2022 IEEE Hot Chips 34 Symposium (HCS). IEEE Computer Society, 1\u201329","author":"Jiang Hong","year":"2022","unstructured":"Hong Jiang . 2022 . Intel\u2019s Ponte Vecchio GPU: Architecture , Systems & Software. In 2022 IEEE Hot Chips 34 Symposium (HCS). IEEE Computer Society, 1\u201329 . Hong Jiang. 2022. Intel\u2019s Ponte Vecchio GPU: Architecture, Systems & Software. In 2022 IEEE Hot Chips 34 Symposium (HCS). IEEE Computer Society, 1\u201329."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Accelerating Large-Scale Graph-based Nearest Neighbor Search on a Computational Storage Platform","volume":"01","author":"Kim Ji-Hoon","year":"2022","unstructured":"Ji-Hoon Kim , Yeo-Reum Park , Jaeyoung Do , Soo-Young Ji , and Joo-Young Kim . 2022 . Accelerating Large-Scale Graph-based Nearest Neighbor Search on a Computational Storage Platform . IEEE Trans. Comput. 01 (2022), 1 \u2013 1 . Ji-Hoon Kim, Yeo-Reum Park, Jaeyoung Do, Soo-Young Ji, and Joo-Young Kim. 2022. Accelerating Large-Scale Graph-based Nearest Neighbor Search on a Computational Storage Platform. IEEE Trans. Comput.01 (2022), 1\u20131.","journal-title":"IEEE Trans. Comput."},{"key":"e_1_3_2_1_23_1","volume-title":"ANNA: Specialized Architecture for Approximate Nearest Neighbor Search. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 169\u2013183","author":"Lee Yejin","year":"2022","unstructured":"Yejin Lee , Hyunji Choi , Sunhong Min , Hyunseung Lee , Sangwon Beak , Dawoon Jeong , Jae\u00a0 W Lee , and Tae\u00a0Jun Ham . 2022 . ANNA: Specialized Architecture for Approximate Nearest Neighbor Search. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 169\u2013183 . Yejin Lee, Hyunji Choi, Sunhong Min, Hyunseung Lee, Sangwon Beak, Dawoon Jeong, Jae\u00a0W Lee, and Tae\u00a0Jun Ham. 2022. ANNA: Specialized Architecture for Approximate Nearest Neighbor Search. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 169\u2013183."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467101"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527439"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 59th ACM\/IEEE Design Automation Conference. 997\u20131002","author":"Liang Shengwen","year":"2022","unstructured":"Shengwen Liang , Ying Wang , Ziming Yuan , Cheng Liu , Huawei Li , and Xiaowei Li . 2022 . VStore: in-storage graph based vector search accelerator . In Proceedings of the 59th ACM\/IEEE Design Automation Conference. 997\u20131002 . Shengwen Liang, Ying Wang, Ziming Yuan, Cheng Liu, Huawei Li, and Xiaowei Li. 2022. VStore: in-storage graph based vector search accelerator. In Proceedings of the 59th ACM\/IEEE Design Automation Conference. 997\u20131002."},{"key":"e_1_3_2_1_28_1","volume-title":"Optimizing Graph-based Approximate Nearest Neighbor Search: Stronger and Smarter. In 2022 23rd IEEE International Conference on Mobile Data Management (MDM). IEEE, 179\u2013184","author":"Liu Jun","year":"2022","unstructured":"Jun Liu , Zhenhua Zhu , Jingbo Hu , Hanbo Sun , Li Liu , Lingzhi Liu , Guohao Dai , Huazhong Yang , and Yu Wang . 2022 . Optimizing Graph-based Approximate Nearest Neighbor Search: Stronger and Smarter. In 2022 23rd IEEE International Conference on Mobile Data Management (MDM). IEEE, 179\u2013184 . Jun Liu, Zhenhua Zhu, Jingbo Hu, Hanbo Sun, Li Liu, Lingzhi Liu, Guohao Dai, Huazhong Yang, and Yu Wang. 2022. Optimizing Graph-based Approximate Nearest Neighbor Search: Stronger and Smarter. In 2022 23rd IEEE International Conference on Mobile Data Management (MDM). IEEE, 179\u2013184."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2354409.2355047"},{"key":"e_1_3_2_1_30_1","volume-title":"2020 International Conference on Field-Programmable Technology (ICFPT). IEEE, 139\u2013147","author":"Lu Alec","year":"2020","unstructured":"Alec Lu , Zhenman Fang , Nazanin Farahpour , and Lesley Shannon . 2020 . CHIP-KNN: A configurable and high-performance k-nearest neighbors accelerator on cloud FPGAs . In 2020 International Conference on Field-Programmable Technology (ICFPT). IEEE, 139\u2013147 . Alec Lu, Zhenman Fang, Nazanin Farahpour, and Lesley Shannon. 2020. CHIP-KNN: A configurable and high-performance k-nearest neighbors accelerator on cloud FPGAs. In 2020 International Conference on Field-Programmable Technology (ICFPT). IEEE, 139\u2013147."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3431920.3439284"},{"key":"e_1_3_2_1_32_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov A","year":"2018","unstructured":"Yu\u00a0 A Malkov and Dmitry\u00a0 A Yashunin . 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs . IEEE transactions on pattern analysis and machine intelligence 42, 4 ( 2018 ), 824\u2013836. Yu\u00a0A Malkov and Dmitry\u00a0A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence 42, 4 (2018), 824\u2013836."},{"key":"e_1_3_2_1_33_1","unstructured":"Microsoft. 2022. Bing Vector Search. [Online]. https:\/\/www.microsoft.com\/en-us\/ai\/ailab-vector-search.  Microsoft. 2022. Bing Vector Search. [Online]. https:\/\/www.microsoft.com\/en-us\/ai\/ailab-vector-search."},{"key":"e_1_3_2_1_34_1","volume-title":"Sptag: A library for fast approximate nearest neighbor search. [Online]. https:\/\/github.com\/microsoft\/SPTAG.","year":"2022","unstructured":"Microsoft. 2022 . Sptag: A library for fast approximate nearest neighbor search. [Online]. https:\/\/github.com\/microsoft\/SPTAG. Microsoft. 2022. Sptag: A library for fast approximate nearest neighbor search. [Online]. https:\/\/github.com\/microsoft\/SPTAG."},{"key":"e_1_3_2_1_35_1","volume-title":"Deep learning recommendation model for personalization and recommendation systems. arXiv preprint arXiv:1906.00091","author":"Naumov Maxim","year":"2019","unstructured":"Maxim Naumov , Dheevatsa Mudigere , Hao- Jun\u00a0Michael Shi , Jianyu Huang , Narayanan Sundaraman , Jongsoo Park , Xiaodong Wang , Udit Gupta , Carole-Jean Wu , Alisson\u00a0 G Azzolini , 2019. Deep learning recommendation model for personalization and recommendation systems. arXiv preprint arXiv:1906.00091 ( 2019 ). Maxim Naumov, Dheevatsa Mudigere, Hao-Jun\u00a0Michael Shi, Jianyu Huang, Narayanan Sundaraman, Jongsoo Park, Xiaodong Wang, Udit Gupta, Carole-Jean Wu, Alisson\u00a0G Azzolini, 2019. Deep learning recommendation model for personalization and recommendation systems. arXiv preprint arXiv:1906.00091 (2019)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643528"},{"key":"e_1_3_2_1_37_1","first-page":"10672","article-title":"Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory","volume":"33","author":"Ren Jie","year":"2020","unstructured":"Jie Ren , Minjia Zhang , and Dong Li . 2020 . Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory . Advances in Neural Information Processing Systems 33 (2020), 10672 \u2013 10684 . Jie Ren, Minjia Zhang, and Dong Li. 2020. Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33 (2020), 10672\u201310684.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_38_1","volume-title":"Advances in neural information processing systems 27","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). Advances in neural information processing systems 27 ( 2014 ). Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). Advances in neural information processing systems 27 (2014)."},{"key":"e_1_3_2_1_39_1","volume-title":"The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4","author":"Toussaint T","year":"1980","unstructured":"Godfried\u00a0 T Toussaint . 1980. The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4 ( 1980 ), 261\u2013268. Godfried\u00a0T Toussaint. 1980. The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4 (1980), 261\u2013268."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450078"},{"key":"e_1_3_2_1_43_1","volume-title":"Design of the RISC-V instruction set architecture","author":"Waterman Andrew\u00a0Shell","unstructured":"Andrew\u00a0Shell Waterman . 2016. Design of the RISC-V instruction set architecture . University of California , Berkeley. Andrew\u00a0Shell Waterman. 2016. Design of the RISC-V instruction set architecture. University of California, Berkeley."},{"key":"e_1_3_2_1_44_1","unstructured":"Xilinx. 2022. Xilinx Alveo U280 FPGA Datacenter Acceleration Card. https:\/\/www.xilinx.com\/products\/boards-and-kits\/alveo\/u280.html.  Xilinx. 2022. Xilinx Alveo U280 FPGA Datacenter Acceleration Card. https:\/\/www.xilinx.com\/products\/boards-and-kits\/alveo\/u280.html."},{"key":"e_1_3_2_1_45_1","volume-title":"2013 19th IEEE International Conference on Networks (ICON). IEEE, 1\u20136.","author":"Yamaguchi Fumito","year":"2013","unstructured":"Fumito Yamaguchi and Hiroaki Nishi . 2013 . Hardware-based hash functions for network applications . In 2013 19th IEEE International Conference on Networks (ICON). IEEE, 1\u20136. Fumito Yamaguchi and Hiroaki Nishi. 2013. Hardware-based hash functions for network applications. In 2013 19th IEEE International Conference on Networks (ICON). IEEE, 1\u20136."},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, Vol.\u00a066","author":"Yianilos N","year":"1993","unstructured":"Peter\u00a0 N Yianilos . 1993 . Data structures and algorithms for nearest neighbor . In Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, Vol.\u00a066 . SIAM, 311. Peter\u00a0N Yianilos. 1993. Data structures and algorithms for nearest neighbor. In Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, Vol.\u00a066. SIAM, 311."},{"key":"e_1_3_2_1_47_1","volume-title":"16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Zeng Chaoliang","year":"2022","unstructured":"Chaoliang Zeng , Layong Luo , Qingsong Ning , Yaodong Han , Yuhang Jiang , Ding Tang , Zilong Wang , Kai Chen , and Chuanxiong Guo . 2022 . { FAERY} : An { FPGA-accelerated} Embedding-based Retrieval System . In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22) . 841\u2013856. Chaoliang Zeng, Layong Luo, Qingsong Ning, Yaodong Han, Yuhang Jiang, Ding Tang, Zilong Wang, Kai Chen, and Chuanxiong Guo. 2022. { FAERY} : An { FPGA-accelerated} Embedding-based Retrieval System. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). 841\u2013856."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1109\/TC.2022.3214113","article-title":"Serving Multi-DNN Workloads on FPGAs: A Coordinated Architecture, Scheduling, and Mapping Perspective","volume":"72","author":"Zeng Shulin","year":"2022","unstructured":"Shulin Zeng , Guohao Dai , Niansong Zhang , Xinhao Yang , Haoyu Zhang , Zhenhua Zhu , Huazhong Yang , and Yu Wang . 2022 . Serving Multi-DNN Workloads on FPGAs: A Coordinated Architecture, Scheduling, and Mapping Perspective . IEEE Trans. Comput. 72 , 5 (2022), 1314 \u2013 1328 . Shulin Zeng, Guohao Dai, Niansong Zhang, Xinhao Yang, Haoyu Zhang, Zhenhua Zhu, Huazhong Yang, and Yu Wang. 2022. Serving Multi-DNN Workloads on FPGAs: A Coordinated Architecture, Scheduling, and Mapping Perspective. IEEE Trans. Comput. 72, 5 (2022), 1314\u20131328.","journal-title":"IEEE Trans. Comput."},{"key":"e_1_3_2_1_49_1","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 4924\u20134932","author":"Zhang Jialiang","year":"2018","unstructured":"Jialiang Zhang , Soroosh Khoram , and Jing Li . 2018 . Efficient large-scale approximate nearest neighbor search on OpenCL FPGA . In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 4924\u20134932 . Jialiang Zhang, Soroosh Khoram, and Jing Li. 2018. Efficient large-scale approximate nearest neighbor search on OpenCL FPGA. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 4924\u20134932."}],"event":{"name":"MICRO '23: 56th Annual IEEE\/ACM International Symposium on Microarchitecture","location":"Toronto ON Canada","acronym":"MICRO '23","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["56th Annual IEEE\/ACM International Symposium on Microarchitecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3613424.3614292","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3613424.3614292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:29Z","timestamp":1750178189000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3613424.3614292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,28]]},"references-count":48,"alternative-id":["10.1145\/3613424.3614292","10.1145\/3613424"],"URL":"https:\/\/doi.org\/10.1145\/3613424.3614292","relation":{},"subject":[],"published":{"date-parts":[[2023,10,28]]},"assertion":[{"value":"2023-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}