Yifan Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yifan Li has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoshe Dong
School of Computer Science and Technology, Xi'an Jiaotong university
2 shared publications - Ziheng Wang
School of Computer Science and Technology, Xi'an Jiaotong university
2 shared publications - BingZhi Long
School of Software, Xi'an Jiaotong University
1 shared publication - Chaoqun Zhang
School of Computer Science and Technology, Xi'an Jiaotong university
1 shared publication - Heng Liu
School of Computer Science and Technology, Xi'an Jiaotong university
1 shared publication - Qiang Wang
Network Information Center, Xi'an Jiaotong University
1 shared publication
Latest Publications
- Open Access
- 2 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
TSE-IO: Two-Stage Extrapolative I/O Modeling and Tuning via Pairwise Learning
Collecting I/O data for parallel programs at large node scales is prohibitively expensive and has long been a major bottleneck for I/O performance modeling. Existing approaches typically depend on extensive training samples collected on large-scale systems, which incur high cost and generalize poorly across applications and environments. To address these challenges, we propose TSE-IO, a T wo- S tage framework for E xtrapolative I/O performance modeling and tuning. TSE-IO decomposes cross-scale performance prediction into two linked tasks: first, extrapolating application-level I/O behavior from small-scale measurements to the target scale. And second, predicting target-scale performance by jointly modeling the extrapolated behavior and tunable I/O-stack configurations. For the second stage, TSE-IO introduces a pairwise formulation that combines delta-feature matching with anchor-based inference to transfer configuration-induced performance patterns learned at small scales to unseen target scales. Experimental results show that, when trained solely on measurements collected from 1-16 nodes, TSE-IO extrapolates the I/O time of IOR, S3D-IO, Flash-IO, FLASH, and LAMMPS to 128 nodes (2,048 processes), achieving a MAPE below 20% for the majority of evaluated workloads. After tuning, five representative applications exhibit significant I/O performance improvements, achieving speedups ranging from 16.38 × to 65.38 ×, and from 1.00 × to 2.79 × compared with expert user settings across different workloads, thereby demonstrating the effectiveness and generality of TSE-IO.
- 2 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
Open AccessTSE-IO: Two-Stage Extrapolative I/O Modeling and Tuning via Pairwise Learning
Collecting I/O data for parallel programs at large node scales is prohibitively expensive and has long been a major bottleneck for I/O performance modeling. Existing approaches typically depend on extensive training samples collected on large-scale systems, which incur high cost and generalize poorly across applications and environments. To address these challenges, we propose TSE-IO, a T wo- S tage framework for E xtrapolative I/O performance modeling and tuning. TSE-IO decomposes cross-scale performance prediction into two linked tasks: first, extrapolating application-level I/O behavior from small-scale measurements to the target scale. And second, predicting target-scale performance by jointly modeling the extrapolated behavior and tunable I/O-stack configurations. For the second stage, TSE-IO introduces a pairwise formulation that combines delta-feature matching with anchor-based inference to transfer configuration-induced performance patterns learned at small scales to unseen target scales. Experimental results show that, when trained solely on measurements collected from 1-16 nodes, TSE-IO extrapolates the I/O time of IOR, S3D-IO, Flash-IO, FLASH, and LAMMPS to 128 nodes (2,048 processes), achieving a MAPE below 20% for the majority of evaluated workloads. After tuning, five representative applications exhibit significant I/O performance improvements, achieving speedups ranging from 16.38 × to 65.38 ×, and from 1.00 × to 2.79 × compared with expert user settings across different workloads, thereby demonstrating the effectiveness and generality of TSE-IO.
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (2) , 1-24
BLG-Tuning: Benchmark-Based Low-Cost General-Purpose I/O Modeling and Tuning
I/O performance has become a major bottleneck for many data-intensive applications. Each layer of the parallel I/O stack provides parameters that can optimize I/O performance, but determining the optimal performance parameters based on the operating configuration is a challenge. Previous work has required separate performance models for different programs for tuning, which is very costly in term of measurement data. We propose BLG-Tuning: a B enchmark-based L ow-cost G eneral-purpose I/O Modeling and Tuning. BLG-Tuning maps application I/O loads to benchmark parameters and uses the benchmark-trained performance model to achieve I/O performance prediction and thus avoid the additional computing and communication overhead for measurement. For applications, BLG-Tuning collects the application characteristics to calibrate the performance model and improve prediction accuracy. Experience shows that BLG-Tuning predicts the I/O time of MADbench2, Flash-IO, S3D-IO, BT-IO, and LAMMPS with MAPE of 22.2%, 18.2%, 29.3%, 21.5%, and 34.8%, respectively. After tuning, the five applications obtain I/O speedup from 5.6× to 27.3×.
- 25 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (2) , 1-24
Open AccessBLG-Tuning: Benchmark-Based Low-Cost General-Purpose I/O Modeling and Tuning
I/O performance has become a major bottleneck for many data-intensive applications. Each layer of the parallel I/O stack provides parameters that can optimize I/O performance, but determining the optimal performance parameters based on the operating configuration is a challenge. Previous work has required separate performance models for different programs for tuning, which is very costly in term of measurement data. We propose BLG-Tuning: a B enchmark-based L ow-cost G eneral-purpose I/O Modeling and Tuning. BLG-Tuning maps application I/O loads to benchmark parameters and uses the benchmark-trained performance model to achieve I/O performance prediction and thus avoid the additional computing and communication overhead for measurement. For applications, BLG-Tuning collects the application characteristics to calibrate the performance model and improve prediction accuracy. Experience shows that BLG-Tuning predicts the I/O time of MADbench2, Flash-IO, S3D-IO, BT-IO, and LAMMPS with MAPE of 22.2%, 18.2%, 29.3%, 21.5%, and 34.8%, respectively. After tuning, the five applications obtain I/O speedup from 5.6× to 27.3×.