Ruihao Li

Ruihao Li

Auto-generated profile, based on publicly available information

Ruihao Li

The University of Texas at Austin, Austin, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
9 August 2021
Verified
Conference Paper
Open access
BHBagus Hanindhito
Bagus Hanindhito
RLRuihao Li
Ruihao Li
DGDimitrios Gourounas
Dimitrios Gourounas
AFArash Fathi
Arash Fathi
KGKaran Govil
Karan Govil
LJLizy John
Lizy John
Wave simulations are used in many applications: medical imaging, oil and gas exploration, earthquake hazard mitigation, and defense systems, among others. Most of these applications require repeated solutions of the wave equation on supercomputers. Minimizing time to solution and energy consumption are very beneficial in this domain. Data movement overhead is one of the key bottlenecks that affect energy consumption. Processing-in-Memory (PIM) has been a popular choice for deploying data-intensive applications, as a result of its high parallelism, low off-chip data movement and low energy consumption. In this paper, we propose an ISA-based, digital PIM system, to accelerate wave simulations. We fully explore the parallelism inside the algorithm, based on the size of the model and the availability of the PIM resources. We also examine the interconnections to optimize the inter-block data transfer. Our Wave-PIM can achieve an average of 41.98 × speedup, as well as 12.66 × energy savings, compared to the three state-of-the-art GPU platforms.

22 June 2023
Verified
Conference Paper
Open access
RLRuihao Li
Ruihao Li
QWQinzhe Wu
Qinzhe Wu
KKKrishna Kavi
Krishna Kavi
GMGayatri Mehta
Gayatri Mehta
NYNeeraja J. Yadwadkar
Neeraja J. Yadwadkar
LJLizy K. John
Lizy K. John
Memory allocation and management have a significant impact on performance and energy of modern applications. We observe that performance can vary by as much as 72% in some applications based on which memory allocator is used. Many current allocators are multi-threaded to support concurrent allocation requests from different threads. However, such multi-threading comes at the cost of maintaining complex metadata that is tightly coupled and intertwined with user data. When memory management functions and other user programs run on the same core, the metadata used by management functions may pollute the processor caches and other resources. In this paper, we make a case for offloading memory allocation (and other similar management functions) from main processing cores to other processing units to boost performance, reduce energy consumption, and customize services to specific applications or application domains. To offload these multi-threaded fine-granularity functions, we propose to decouple the metadata of these functions from the rest of application data to reduce the overhead of inter-thread metadata synchronization. We draw attention to the following key questions to realize this opportunity: (a) What are the tradeoffs and challenges in offloading memory allocation to a dedicated core? (b) Should we use general-purpose cores or special-purpose cores for executing critical system management functions? (c) Can this methodology apply to heterogeneous systems (e.g., with GPUs, accelerators) and other service functions as well?

19 November 2025
Verified
Conference Paper
Open access
RLRuihao Li
Ruihao Li
SPShagnik Pal
Shagnik Pal
VPVineeth Narayan Pullu
Vineeth Narayan Pullu
PSPrasoon Sinha
Prasoon Sinha
Jeeho RyooJeeho Ryoo
Jeeho Ryoo
NYNeeraja J. Yadwadkar
Neeraja J. Yadwadkar

26 June 2025 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
RLRuihao Li
Ruihao Li
BHBagus Hanindhito
Bagus Hanindhito
SYSanjana Yadav
Sanjana Yadav
QWQinzhe Wu
Qinzhe Wu
KKKrishna Kavi
Krishna Kavi
LJLizy K. John
Lizy K. John
Driven by the increasing demands of machine learning, heterogeneous systems combining CPUs and GPUs have emerged as the dominant architecture for parallel computing in recent years. To optimize memory management and data transfer between CPUs and GPUs, Nvidia GPUs have introduced unified virtual memory ( UVM ) and pinned memory ( PM ) over the last decade. UVM can avoid explicit memory copies and potentially overlap GPU kernel computations with CPU-GPU data transfer. PM ensures that data with high locality remains in the main memory, preventing it from being paged out. In addition to these two techniques, asynchronous memory copy ( Async Memcpy ) was introduced recently in Nvidia GPUs to improve the CPU-GPU pipeline further. By utilizing Async Memcpy , the data transfer from GPU global memory to shared memory can be overlapped with GPU computations, adding an additional stage to the CPU-GPU data transfer pipeline. A thorough performance analysis of how Async Memcpy affects the current UVM and PM CPU-GPU data transfer scheme is desired. In this paper, we provide performance implications of the combined effect of UVM , PM , and Async Memcpy , exploring which applications benefit from which combination of these features. We implement all these features on a suite of 25 workloads, including microbenchmarks and realworld applications. We observe an average performance gain of \(24\% \) when utilizing UVM and a \(34\% \) gain when employing PM on realworld applications, compared to not applying any data transfer optimization techniques. The performance benefits of Async Memcpy vary across different workloads. For workloads featuring extensive shared memory usage and high compute density (e.g., kmeans and lud ), Async Memcpy delivers around a 20% performance improvement over using UVM or PM alone. In other workloads like knn , we note a \(20\% \) performance degradation when using Async Memcpy . Furthermore, we conduct an in-depth investigation of the GPU kernel using performance counters to uncover the root causes of performance differences among various data transfer models. We also perform sensitivity analyses to examine how the number of blocks and threads, as well as the L1-cache/shared memory partitioning, impact performance. We explore future research directions aimed at enhancing the data transfer pipeline by overlapping memory allocation with data transfer and computation across GPU kernels.

29 June 2025
Verified
Conference Paper
Open access
RLRuihao Li
Ruihao Li
SMSiyuan Ma
Siyuan Ma
KKKrishna Kavi
Krishna Kavi
GMGayatri Mehta
Gayatri Mehta
NYNeeraja J. Yadwadkar
Neeraja J. Yadwadkar
LJLizy K. John
Lizy K. John

10 July 2025 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
RLRuihao Li
Ruihao Li
LJLizy K. John
Lizy K. John
NYNeeraja J. Yadwadkar
Neeraja J. Yadwadkar
Memory allocators, though constituting a small portion of the entire program code, can significantly impact application performance by affecting global factors such as cache behaviors. Moreover, memory allocators are often regarded as a “datacenter tax” inherent to all programs. Even a 1% improvement in performance can lead to significant cost and energy savings when scaled across an entire datacenter fleet. Modern memory allocators are designed to optimize allocation speed and memory fragmentation in multi-threaded environments, relying on complex metadata and control logic to achieve high performance. However, the overhead introduced by this complexity prompts a reevaluation of allocator design. Notably, such overhead can be avoided in single-threaded scenarios, which continue to be widely used across diverse application domains. In this paper, we present ExGen-Malloc, a memory allocator specifically optimized for single-threaded applications. We prototyped ExGen-Malloc, on a real system and demonstrated that it achieves a geometric mean speedup of 1.19 × over dlmalloc and 1.03 × over mimalloc, a modern multi-threaded allocator developed by Microsoft, on the SPEC CPU2017 benchmark suite.