Xinliang David Li

Xinliang David Li

Auto-generated profile, based on publicly available information

Xinliang David Li

Google, Mountain View, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 February 2017
Verified
Conference Paper
Closed access
TJTeresa Johnson
Teresa Johnson
MAMehdi Amini
Mehdi Amini
XLXinliang David Li
Xinliang David Li
Cross-Module Optimization (CMO) is an effective means for improving runtime performance, by extending the scope of optimizations across source module boundaries. Two CMO approaches are Link-Time Optimization (LTO) and Lightweight Inter-Procedural Optimization (LIPO). However, each of these solutions has limitations that prevent it from being enabled by default. ThinLTO is a new approach that attempts to address these limitations, with a goal of being enabled more broadly. ThinLTO aims to be as scalable as a regular non-LTO build, enabling CMO on large applications and machines without large memory configurations, while also integrating well with distributed and incremental build systems. This is achieved through fast purely summary-based Whole-Program Analysis (WPA), the only serial step, without reading or writing the program's Intermediate Representation (IR). Instead, CMO is applied during fully parallel optimization backends. This paper describes the motivation behind ThinLTO, its overall design, and current implementation in LLVM. Results from SPEC cpu2006 benchmarks and several large real-world applications illustrate that ThinLTO can scale as well as a non-LTO build while enabling most of the CMO performed with a full LTO build.

30 March 2025
Verified
Conference Paper
Open access
SASotiris Apostolakis
Sotiris Apostolakis
CKChris Kennelly
Chris Kennelly
XLXinliang David Li
Xinliang David Li
PRParthasarathy Ranganathan
Parthasarathy Ranganathan

1 March 2025
Verified
Conference Paper
Open access
RHRenato B. Hoffmann
Renato B. Hoffmann
LFLeonardo G. Faé
Leonardo G. Faé
DGDalvan Griebler
Dalvan Griebler
XLXinliang David Li
Xinliang David Li
FPFernando Magno Quintão Pereira
Fernando Magno Quintão Pereira
This paper introduces a technique for synthesizing hash functions specialized to particular byte formats. This code generation method leverages three prevalent patterns: (i) fixed-length keys, (ii) keys with common subsequences, and (iii) keys ranging on predetermined sequences of bytes. Code generation involves two algorithms: one identifies relevant regular expressions within key examples, and the other generates specialized hash functions based on these expressions. Comparative analysis demonstrates that the synthetic functions outperform the general-purpose hashes in the C++ Standard Template Library and the Google Abseil Library when keys are given in ascending, normal or uniform distribution. In applications where low-mixing hashes are acceptable, the synthetic functions achieve speedups ranging from 2% to 11% on full benchmarks, and speedups of almost 50x once only hashing speed is considered.

1 March 2025
Verified
Conference Paper
Open access
CAChaitanya Mamatha Ananda
Chaitanya Mamatha Ananda
RGRajiv Gupta
Rajiv Gupta
STSriraman Tallam
Sriraman Tallam
HSHan Shen
Han Shen
XLXinliang David Li
Xinliang David Li
Analyses of heap-intensive applications show that a small fraction of heap objects account for the majority of heap accesses and data cache misses. Prior works like HDS and HALO have shown that allocating hot objects in separate memory regions can improve spatial locality leading to better application performance. However, these techniques are constrained in two primary ways, limiting their gains. First, these techniques have Imperfect Separation, polluting the hot memory region with several cold objects. Second, reordering of objects across allocations is not possible as the original object allocation order is preserved. This paper presents a novel technique that achieves near perfect separation of hot objects via a new context mechanism that efficiently identifies hot objects with high precision. This technique, named PreFix, is based upon Preallocating memory for a Fixed small number of hot objects. The program, guided by profiles, is instrumented to compute context information derived from dynamic object identifiers, that precisely identifies hot object allocations that are then placed at predetermined locations in the preallocated memory. The preallocated memory region for hot objects provides the flexibility to reorder objects across allocations and allows colocation of objects that are part of a hot data stream (HDS), improving spatial locality. The runtime overhead of identifying hot objects is not significant as this optimization is only focused on a small number of static hot allocation sites and dynamic hot objects. While there is an increase in the program's memory foot-print, it is manageable and can be controlled by limiting the size of the preallocated memory. In addition, PreFix incorporates an object recycling optimization that reuses the same preallocated space to store different objects whose lifetimes are not expected to overlap. Our experiments with 13 heap-intensive applications yield reductions in execution times ranging from 2.77% to 74%. On average PreFix reduces execution time by 21.7% compared to 7.3% by HDS and 14% by HALO. This is due to PreFix's precision in hot object identification, hot object colocation, and low runtime overhead.

1 September 2026 in IEEE Micro
Verified
Journal Article
Open access
SASotiris Apostolakis
Sotiris Apostolakis
CKChris Kennelly
Chris Kennelly
XLXinliang David Li
Xinliang David Li
PRParthasarathy Ranganathan
Parthasarathy Ranganathan
Memory bandwidth is emerging as a critical bottleneck in warehouse-scale computing (WSC). This work reveals that a significant portion of memory traffic in WSC is surprisingly unnecessary, consisting of needless writebacks of deallocated data and fetches of uninitialized data. This issue is particularly acute in WSC, where short-lived heap allocations bigger than a cache line are prevalent. To address this problem, this work proposes a pragmatic approach tailored to WSC. Leveraging the existing WSC ecosystem of vertical integration, profile-guided compilation flows, and customized memory allocators, this work presents NECRO-REAPER, a novel software/hardware co-design that avoids dead memory traffic without requiring the hardware tracking of prior work. Evaluations across diverse WSC workloads demonstrate that NECRO-REAPER reduces memory traffic by 26% and improves IPC by 6%. More broadly, this work drives a paradigm shift in memory efficiency, moving the design goal from simply optimizing raw bandwidth to maximizing semantic goodput.

15 June 2026
Verified
Conference Paper
Open access
CAChaitanya Mamatha Ananda
Chaitanya Mamatha Ananda
MAMahbod Afarin
Mahbod Afarin
RGRajiv Gupta
Rajiv Gupta
STSriraman Tallam
Sriraman Tallam
HSHan Shen
Han Shen
XLXinliang David Li
Xinliang David Li