{"type":"conference","date_created":"2024-10-08T12:48:11Z","extern":"1","intvolume":" 11","scopus_import":"1","publication_identifier":{"isbn":["9781450399180"]},"year":"2023","related_material":{"link":[{"url":"https://doi.org/10.5281/zenodo.7699872","relation":"software"}]},"quality_controlled":"1","page":"282-301","volume":11,"citation":{"chicago":"Ye, Haojie, Sanketh Vedula, Yuhan Chen, Yichen Yang, Alex M. Bronstein, Ronald Dreslinski, Trevor Mudge, and Nishil Talati. “GRACE: A Scalable Graph-Based Approach to Accelerating Recommendation Model Inference.” In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 11:282–301. Association for Computing Machinery, 2023. https://doi.org/10.1145/3582016.3582029.","short":"H. Ye, S. Vedula, Y. Chen, Y. Yang, A.M. Bronstein, R. Dreslinski, T. Mudge, N. Talati, in:, Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Association for Computing Machinery, 2023, pp. 282–301.","ama":"Ye H, Vedula S, Chen Y, et al. GRACE: A scalable graph-based approach to accelerating recommendation model inference. In: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. Vol 11. Association for Computing Machinery; 2023:282-301. doi:10.1145/3582016.3582029","mla":"Ye, Haojie, et al. “GRACE: A Scalable Graph-Based Approach to Accelerating Recommendation Model Inference.” Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, vol. 11, no. 3, Association for Computing Machinery, 2023, pp. 282–301, doi:10.1145/3582016.3582029.","apa":"Ye, H., Vedula, S., Chen, Y., Yang, Y., Bronstein, A. M., Dreslinski, R., … Talati, N. (2023). GRACE: A scalable graph-based approach to accelerating recommendation model inference. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Vol. 11, pp. 282–301). Association for Computing Machinery. https://doi.org/10.1145/3582016.3582029","ieee":"H. Ye et al., “GRACE: A scalable graph-based approach to accelerating recommendation model inference,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023, vol. 11, no. 3, pp. 282–301.","ista":"Ye H, Vedula S, Chen Y, Yang Y, Bronstein AM, Dreslinski R, Mudge T, Talati N. 2023. GRACE: A scalable graph-based approach to accelerating recommendation model inference. Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. vol. 11, 282–301."},"date_published":"2023-03-01T00:00:00Z","publication_status":"published","status":"public","oa_version":"None","month":"03","doi":"10.1145/3582016.3582029","language":[{"iso":"eng"}],"author":[{"last_name":"Ye","first_name":"Haojie","full_name":"Ye, Haojie"},{"last_name":"Vedula","first_name":"Sanketh","full_name":"Vedula, Sanketh"},{"full_name":"Chen, Yuhan","first_name":"Yuhan","last_name":"Chen"},{"full_name":"Yang, Yichen","first_name":"Yichen","last_name":"Yang"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander"},{"last_name":"Dreslinski","first_name":"Ronald","full_name":"Dreslinski, Ronald"},{"full_name":"Mudge, Trevor","last_name":"Mudge","first_name":"Trevor"},{"first_name":"Nishil","last_name":"Talati","full_name":"Talati, Nishil"}],"day":"01","publisher":"Association for Computing Machinery","publication":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","abstract":[{"lang":"eng","text":"The high memory bandwidth demand of sparse embedding layers continues to be a critical challenge in scaling the performance of recommendation models. While prior works have exploited heterogeneous memory system designs and partial embedding sum memoization techniques, they offer limited benefits. This is because prior designs either target a very small subset of embeddings to simplify their analysis or incur a high processing cost to account for all embeddings, which does not scale with the large sizes of modern embedding tables. This paper proposes GRACE-a lightweight and scalable graph-based algorithm-system co-design framework to significantly improve the embedding layer performance of recommendation models. GRACE proposes a novel Item Co-occurrence Graph (ICG) that scalably records item co-occurrences. GRACE then presents a new system-aware ICG clustering algorithm to find frequently accessed item combinations of arbitrary lengths to compute and memoize their partial sums. High-frequency partial sums are stored in a software-managed cache space to reduce memory traffic and improve the throughput of computing sparse features. We further present a cache data layout and low-cost address computation logic to efficiently lookup item embeddings and their partial sums. Our evaluation shows that GRACE significantly outperforms the state-of-the-art techniques SPACE and MERCI by 1.5x and 1.4x, respectively."}],"date_updated":"2024-10-09T11:21:19Z","_id":"18212","article_processing_charge":"No","title":"GRACE: A scalable graph-based approach to accelerating recommendation model inference","issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}