Shiyang Li

Shiyang Li

Auto-generated profile, based on publicly available information

Shiyang Li

University of Minnesota Twin Cities

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SLShiyang Li
Shiyang Li
RTRuiqi Tang
Ruiqi Tang
JZJingyu Zhu
Jingyu Zhu
ZZZiyi Zhao
Ziyi Zhao
XGXiaoli Gong
Xiaoli Gong
PYPen-Chung Yew
Pen-Chung Yew
Graph analytics are widely used including recommender systems, scientific computing, and data mining. Meanwhile, GPU has become the major accelerator for such applications. However, the graph size increases rapidly and often exceeds the GPU memory, incurring severe performance degradation due to frequent data transfers between the main memory and GPUs. To relieve this problem, we focus on the utilization of data in GPUs by taking advantage of the data reuse across iterations. In our studies, we deeply analyze the memory access patterns of graph applications at different granularities. We have found that the memory footprint is accessed with a roughly sequential scan without a hotspot, which infers an extremely long reuse distance. Based on our observation, we propose a novel framework, called Liberator , to exploit the data reuse within GPU memory. In Liberator , GPU memory is reserved for the data potentially accessed across iterations to avoid excessive data transfer between the main memory and GPUs. For the data not existing in GPU memory, a Merged and Aligned memory access manner is employed to improve the transmission efficiency. We also further optimize the framework by parallel processing of data in GPU memory and data in the main memory. We have implemented a prototype of the Liberator framework and conducted a series of experiments on performance evaluation. The experimental results show that Liberator can significantly reduce the data transfer overhead, which achieves an average of 2.7x speedup over a state-of-the-art approach.

8 June 2025
Verified
Conference Paper
Open access
YLYuebo Luo
Yuebo Luo
SLShiyang Li
Shiyang Li
JTJunran Tao
Junran Tao
KTKiran Gautam Thorat
Kiran Gautam Thorat
XXXi Xie
Xi Xie
SHShaoyi Huang
Shaoyi Huang

26 July 2026
Verified
Conference Paper
Open access
YLYuebo Luo
Yuebo Luo
SLShiyang Li
Shiyang Li
YFYifei Feng
Yifei Feng
VKVishal Kancharla
Vishal Kancharla
SHShaoyi Huang
Shaoyi Huang
CDCaiwen Ding
Caiwen Ding

13 October 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
XLXingze Liu
Xingze Liu
JDJialin Dong
Jialin Dong
XLXinyu Liu
Xinyu Liu
LWLizhi Wang
Lizhi Wang
SLShiyang Li
Shiyang Li
PYPen-Chung Yew
Pen-Chung Yew
Page swapping remains the dominant mechanism for extending physical memory in modern operating systems. Despite the emergence of new memory technologies, swap-based memory extension continues to be widely deployed due to its transparency and compatibility with diverse storage backends. However, current Linux swap management relies on a simple priority-based policy when multiple heterogeneous backends are available, and is oblivious to page reuse behavior. As a result, fast devices are often occupied by pages that are rarely reused, while frequently refaulted pages are placed on slow devices, leading to unnecessary performance degradation under memory pressure. We present PagePilot , a reuse-aware page offloading framework for heterogeneous swap systems. PagePilot persistently tracks refault behavior across eviction and refault cycles and uses average refault distance to guide backend selection. In addition, a background migration mechanism corrects misplacements to preserve fast-device capacity for pages with imminent reuse. We implement PagePilot in the Linux 6.3 kernel and evaluate it using representative data-serving and analytics workloads. Our results show that PagePilot improves application throughput and reduces page-fault handling latency under memory pressure, while substantially increasing the fraction of refaults served by fast backends.