Feng Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Feng Yu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Bingsheng He
National University of Singapore, Singapore, Singapore
2 shared publications - Hongshi Tan
National University of Singapore, Singapore, Singapore
2 shared publications - Weng-Fai Wong
National University of Singapore, Singapore, Singapore
2 shared publications - Yao Chen
Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Gustavo Alonso
ETH Zurich, Zurich, Switzerland
1 shared publication - Qihao Cheng
Tsinghua University, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 504-518
JetFire: Approximate-then-Correct Attention on Hybrid Memory for Long-Context LLM Inference
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 504-518
Open AccessJetFire: Approximate-then-Correct Attention on Hybrid Memory for Long-Context LLM Inference
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Reproducibility Report for ACM SIGMOD 2025 Paper: 'PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models'
We successfully reproduced the key performance results that presented in Tables~3 and~4 of the original paper. The authors provided a GitHub repository. https://github.com/bytedance/plm4ndv that includes the implementation, detailed build and execution instructions, and links to the datasets used in the experiments. We appreciate the authors' assistance with environment setup and debugging.
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessReproducibility Report for ACM SIGMOD 2025 Paper: 'PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models'
We successfully reproduced the key performance results that presented in Tables~3 and~4 of the original paper. The authors provided a GitHub repository. https://github.com/bytedance/plm4ndv that includes the implementation, detailed build and execution instructions, and links to the datasets used in the experiments. We appreciate the authors' assistance with environment setup and debugging.
- Open Access
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Clementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing
Efficient graph processing is critical in various modern applications, such as social network analysis, recommendation systems, and large-scale data mining. Traditional single-FPGA systems struggle to handle the increasing size and complexity of real-world graphs due to limitations in memory and computational resources. Existing multi-FPGA solutions face significant challenges, including high communication overhead caused by irregular data transfer patterns and workload imbalances stemming from skewed graph distributions. These inefficiencies hinder scalability and performance, highlighting a critical research gap. To address these issues, we introduce Clementi, an efficient multi-FPGA graph processing framework that features customized fine-grained pipelines for computation and cross-FPGA communication. Clementi uniquely integrates an accurate performance model for execution time prediction, enabling a novel scheduling method that balances workload distribution and minimizes communication overhead by overlapping communication and computation stages. Experimental results demonstrate that Clementi achieves speedups of up to 8.75× compared to state-of-the-art multi-FPGA designs, indicating significant improvements in processing efficiency as the number of FPGAs increases. This near-linear scalability underscores the framework' s potential to enhance graph processing capabilities in practical applications. Clementi is open-sourced at https://github.com/Xtra-Computing/Clementi.
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Open AccessClementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing
Efficient graph processing is critical in various modern applications, such as social network analysis, recommendation systems, and large-scale data mining. Traditional single-FPGA systems struggle to handle the increasing size and complexity of real-world graphs due to limitations in memory and computational resources. Existing multi-FPGA solutions face significant challenges, including high communication overhead caused by irregular data transfer patterns and workload imbalances stemming from skewed graph distributions. These inefficiencies hinder scalability and performance, highlighting a critical research gap. To address these issues, we introduce Clementi, an efficient multi-FPGA graph processing framework that features customized fine-grained pipelines for computation and cross-FPGA communication. Clementi uniquely integrates an accurate performance model for execution time prediction, enabling a novel scheduling method that balances workload distribution and minimizes communication overhead by overlapping communication and computation stages. Experimental results demonstrate that Clementi achieves speedups of up to 8.75× compared to state-of-the-art multi-FPGA designs, indicating significant improvements in processing efficiency as the number of FPGAs increases. This near-linear scalability underscores the framework' s potential to enhance graph processing capabilities in practical applications. Clementi is open-sourced at https://github.com/Xtra-Computing/Clementi.