Han Shen

Han Shen

Auto-generated profile, based on publicly available information

Han Shen

Google, Mountain View, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 February 2020 in Signal Processing: Image Communication
Verified
Journal Article
Closed access
YWYong Wang
Yong Wang
XWXian Wei
Xian Wei
HSHao Shen
Hao Shen
HLHabte Tadesse Likassa
Habte Tadesse Likassa
HYHui Yu
Hui Yu

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.

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