Lei Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Lei Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Chun Jason Xue
Mohamed bin Zayed University of Artificial Intelligence
2 shared publications - Riwei Pan
Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong, Hong Kong
2 shared publications - Tei-Wei Kuo
National Taiwan University
2 shared publications - Yu Liang
ETH Zurich, Zurich, Switzerland
2 shared publications - Hongchao Du
Department of Computer Science, City University of Hong Kong
1 shared publication - Nan Guan
City University of Hong Kong
1 shared publication
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 99-104
User Space Buffer Cache with the Bells and Whistles of a Kernel Page Cache
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 99-104
Open AccessUser Space Buffer Cache with the Bells and Whistles of a Kernel Page Cache
- Open Access
- 13 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 22 (3) , 1-26
Efficient Hash-free Mobile Cloud Backup via Operation-Log Versioning
Mobile cloud backup applications are widely used to safeguard user data. This paper found that current cloud backup is inefficient on resource-limited mobile devices because it consumes excessive CPU resources for delta synchronization that requires intensive hash computation to identify the modified ranges of file data. To address this issue, this paper presents SolFS, an operation log versioning file system to optimize mobile cloud backup efficiency. The core idea is that if the cloud backup application knows the modified offset and length of each write since the last backup, it will be able to identify the new modified data and upload them only, avoiding data hashing throughout the entire file. SolFS proposes a series of designs to achieve this design goal. First, SolFS introduces per-file mergeable operation logging that allows each file to manage its write operation logs (i.e., offset and length) in an extent tree and merge operation logs with contiguous or overlapping modified ranges of file data. Then, SolFS proposes the operation log persistence and versioning mechanism that allows different cloud backup applications to manage their own file versions without interfering with each other. In addition, SolFS incorporates techniques such as compact log and dynamic granularity, to optimize the memory and storage overhead to the system. Finally, SolFS achieves hash-free file difference identification with the minimum extra overhead and extends the ability of cloud backup applications. In addition to the APP side, we extend the SolFS design to the cloud backup server to reduce the server-side computation overhead. Furthermore, the SolFS-enabled server integrates a new shadow file mechanism to significantly mitigate the write overhead caused by file reconstruction. The experimental results show that SolFS can significantly reduce the computational overhead of server-side by over 90% on average and the total cloud synchronization time by over 88.8% when files are updated. On the server side, the SolFS-enabled server can reduce up to 78% of file reconstruction latency.
- 13 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 22 (3) , 1-26
Open AccessEfficient Hash-free Mobile Cloud Backup via Operation-Log Versioning
Mobile cloud backup applications are widely used to safeguard user data. This paper found that current cloud backup is inefficient on resource-limited mobile devices because it consumes excessive CPU resources for delta synchronization that requires intensive hash computation to identify the modified ranges of file data. To address this issue, this paper presents SolFS, an operation log versioning file system to optimize mobile cloud backup efficiency. The core idea is that if the cloud backup application knows the modified offset and length of each write since the last backup, it will be able to identify the new modified data and upload them only, avoiding data hashing throughout the entire file. SolFS proposes a series of designs to achieve this design goal. First, SolFS introduces per-file mergeable operation logging that allows each file to manage its write operation logs (i.e., offset and length) in an extent tree and merge operation logs with contiguous or overlapping modified ranges of file data. Then, SolFS proposes the operation log persistence and versioning mechanism that allows different cloud backup applications to manage their own file versions without interfering with each other. In addition, SolFS incorporates techniques such as compact log and dynamic granularity, to optimize the memory and storage overhead to the system. Finally, SolFS achieves hash-free file difference identification with the minimum extra overhead and extends the ability of cloud backup applications. In addition to the APP side, we extend the SolFS design to the cloud backup server to reduce the server-side computation overhead. Furthermore, the SolFS-enabled server integrates a new shadow file mechanism to significantly mitigate the write overhead caused by file reconstruction. The experimental results show that SolFS can significantly reduce the computational overhead of server-side by over 90% on average and the total cloud synchronization time by over 88.8% when files are updated. On the server side, the SolFS-enabled server can reduce up to 78% of file reconstruction latency.