Lihua Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Lihua Yang has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
Fang Wang
2 shared publications- Huijun Wu
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications - Jiaxin Li
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications Wei Zhang
2 shared publicationsWeizhao Lin
2 shared publications- Wenzhe Zhang
College of Computer Science and Technology, National University of Defense Technology, Changsha, Hunan, China
2 shared publications
Latest Publications
- Open Access
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-15
NAGC: Node-Aware Garbage Collection for F2FS
- 2 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Open AccessNAGC: Node-Aware Garbage Collection for F2FS
- Open Access
- 6 August 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 186
Revisiting free space fragmentation: A new garbage collection scheme for F2FS
- 6 August 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 186
Open AccessRevisiting free space fragmentation: A new garbage collection scheme for F2FS
- 3 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (3) , 618-632
A Survey on Machine Learning-Based HPC I/O Analysis and Optimization
The soaring computing power of HPC systems supports numerous large-scale applications, which generate massive data volumes and diverse I/O patterns, leading to severe I/O bottlenecks. Analyzing and optimizing HPC I/O is therefore critical. However, traditional approaches are typically customized and lack the adaptability required to cope with dynamic changes in HPC environments. To address the challenge, Machine Learning (ML) has been increasingly adopted to automate and enhance I/O analysis and optimization. Given sufficient I/O traces from HPC systems, ML can learn underlying I/O behaviors, extract actionable insights, and dynamically adapt to evolving workloads to improve performance. In this survey, we propose a novel taxonomy that aligns HPC I/O problems with learning tasks to systematically review existing studies. Through this taxonomy, we synthesize key findings on research distribution, data preparation, and model selection. Finally, we discuss several directions to advance the effective integration of ML in HPC I/O systems.
- 3 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (3) , 618-632
A Survey on Machine Learning-Based HPC I/O Analysis and Optimization
The soaring computing power of HPC systems supports numerous large-scale applications, which generate massive data volumes and diverse I/O patterns, leading to severe I/O bottlenecks. Analyzing and optimizing HPC I/O is therefore critical. However, traditional approaches are typically customized and lack the adaptability required to cope with dynamic changes in HPC environments. To address the challenge, Machine Learning (ML) has been increasingly adopted to automate and enhance I/O analysis and optimization. Given sufficient I/O traces from HPC systems, ML can learn underlying I/O behaviors, extract actionable insights, and dynamically adapt to evolving workloads to improve performance. In this survey, we propose a novel taxonomy that aligns HPC I/O problems with learning tasks to systematically review existing studies. Through this taxonomy, we synthesize key findings on research distribution, data preparation, and model selection. Finally, we discuss several directions to advance the effective integration of ML in HPC I/O systems.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (1) , 304-321
Fully Decentralized Data Distribution for Large-Scale HPC Systems
For many years, in the HPC data distribution scenario, as the scale of the HPC system continues to increase, manufacturers have to increase the number of data providers to improve the IO parallelism to match the data demanders. In large-scale, especially exascale HPC systems, this mode of decoupling the demander and provider presents significant scalability limitations and incurs substantial costs. In our view, only a distribution model in which the demander also acts as the provider can fundamentally cope with changes in scale and have the best scalability, which is called all-to-all data distribution mode in this paper. We design and implement the BitTorrent protocol on computing networks in HPC systems and propose FD3, a fully decentralized data distribution method. We design the Requested-to-Validated Table (RVT) and the Highest ranking and Longest consecutive piece segment First (HLF) policy based on the features of the HPC networking environment to improve the performance of FD3. In addition, we design a torrent-tree to accelerate the distribution of seed file data and the aggregation of distribution state, and release the tracker load with neighborhood local-generation algorithm. Experimental results show that FD3 can scale smoothly to 11k+ computing nodes, and its performance is much better than that of the parallel file system. Compared with the original BitTorrent, the performance is improved by 8-15 times. FD3 highlights the considerable potential of the all-to-all model in HPC data distribution scenarios. Furthermore, the work of this paper can further stimulate the exploration of future distributed parallel file systems and provide a foundation and inspiration for the design of data access patterns for Exscale HPC systems.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (1) , 304-321
Fully Decentralized Data Distribution for Large-Scale HPC Systems
For many years, in the HPC data distribution scenario, as the scale of the HPC system continues to increase, manufacturers have to increase the number of data providers to improve the IO parallelism to match the data demanders. In large-scale, especially exascale HPC systems, this mode of decoupling the demander and provider presents significant scalability limitations and incurs substantial costs. In our view, only a distribution model in which the demander also acts as the provider can fundamentally cope with changes in scale and have the best scalability, which is called all-to-all data distribution mode in this paper. We design and implement the BitTorrent protocol on computing networks in HPC systems and propose FD3, a fully decentralized data distribution method. We design the Requested-to-Validated Table (RVT) and the Highest ranking and Longest consecutive piece segment First (HLF) policy based on the features of the HPC networking environment to improve the performance of FD3. In addition, we design a torrent-tree to accelerate the distribution of seed file data and the aggregation of distribution state, and release the tracker load with neighborhood local-generation algorithm. Experimental results show that FD3 can scale smoothly to 11k+ computing nodes, and its performance is much better than that of the parallel file system. Compared with the original BitTorrent, the performance is improved by 8-15 times. FD3 highlights the considerable potential of the all-to-all model in HPC data distribution scenarios. Furthermore, the work of this paper can further stimulate the exploration of future distributed parallel file systems and provide a foundation and inspiration for the design of data access patterns for Exscale HPC systems.
- Open Access
- 10 October 2025
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 207
A lightweight fine-grained scheme for distinguishing the hotness of warm data to reduce segment cleaning overhead
- 10 October 2025
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 207
Open AccessA lightweight fine-grained scheme for distinguishing the hotness of warm data to reduce segment cleaning overhead
- 26 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (1) , 169-182
Improving F2FS Performance in Mobile Devices With Adaptive Reserved Space Based on Traceback
As we all know, file and free space fragmentation negatively affect file system performance. F2FS is a file system designed for flash memory. However, it suffers from severe fragmentation due to out-of-place updates and the highly synchronous, multithreaded writing behaviors of applications. The adaptive reserved space (ARS) scheme chooses some files instead of all files to update in the reserved space which collects file features associated with fragmentation to construct datasets and uses decision trees to pick reserved files. However, ARS processes file features according to write fds . On the one hand, fds and files are mapped many-to-many, so there is an issue in mapping reserved files according to reserved fds that a normal file is selected as a reserved file. On the other hand, the mapping of files to fds for big data traces is confusing. We propose ARST that traces the file of write fd to optimize ARS. Moreover, by selecting time-independent file features, ARST predicts whether files with little historical information are reserved to maximize the performance improvement brought by reserving space. Besides, adjustable reserved space and dynamic reservation strategies are adopted. We implement ARST on a HiKey960 development platform and a commercial smartphone with slight space and file creation time overheads. Experimental results show that ARST reduces file and free space fragmentation dramatically and improves file system performance. ARST reduces the running time of realistic workloads by up to 94.28% than F2FS with in-place updates and outperforms ARS by up to 49.06% for Wechat.
- 26 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (1) , 169-182
Improving F2FS Performance in Mobile Devices With Adaptive Reserved Space Based on Traceback
As we all know, file and free space fragmentation negatively affect file system performance. F2FS is a file system designed for flash memory. However, it suffers from severe fragmentation due to out-of-place updates and the highly synchronous, multithreaded writing behaviors of applications. The adaptive reserved space (ARS) scheme chooses some files instead of all files to update in the reserved space which collects file features associated with fragmentation to construct datasets and uses decision trees to pick reserved files. However, ARS processes file features according to write fds . On the one hand, fds and files are mapped many-to-many, so there is an issue in mapping reserved files according to reserved fds that a normal file is selected as a reserved file. On the other hand, the mapping of files to fds for big data traces is confusing. We propose ARST that traces the file of write fd to optimize ARS. Moreover, by selecting time-independent file features, ARST predicts whether files with little historical information are reserved to maximize the performance improvement brought by reserving space. Besides, adjustable reserved space and dynamic reservation strategies are adopted. We implement ARST on a HiKey960 development platform and a commercial smartphone with slight space and file creation time overheads. Experimental results show that ARST reduces file and free space fragmentation dramatically and improves file system performance. ARST reduces the running time of realistic workloads by up to 94.28% than F2FS with in-place updates and outperforms ARS by up to 49.06% for Wechat.