Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tianheng Lu

dblp:388/1512 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0002-4502-8667ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 92% Memory systems · 8%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › serverless computing
cold start mitigation
1.012026
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State · IEEE Trans. Computers 2026
Cloud and datacenter computing
keep-alive policy
1.012026
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State · IEEE Trans. Computers 2026
Cloud and datacenter computing
serverless computing
1.012026
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State · IEEE Trans. Computers 2026
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.312026
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State · IEEE Trans. Computers 2026
Memory systems › memory management
memory allocation
0.312026
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State · IEEE Trans. Computers 2026

Methods — techniques the papers use, named apart from their topics

online marginal utility estimation · 1.0cost-aware resource allocation · 1.0
YearPublicationVenuePosition
2026 Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State
abstract
Keeping runtime alive is critical for mitigating cold start issues in Function-as-a-Service (FaaS) platforms. State-of-the-Art (SOTA) keep-alive policies often draw an analogy to data caching, adapting classic replacement algorithms to manage runtime pools. Our analysis reveals that this analogy is fundamentally flawed: 1) they violate their own eviction priorities due to conflicts with running containers, and 2) they ignore the exorbitant memory-time resource cost of runtime replacement. To address these challenges, we present FaaShadow, a lightweight keep-alive policy that recasts the problem from simple caching to cost-aware resource allocation. FaaShadow introduces the concept of a shadow pool, a per-function data structure that enables online estimation of the marginal utility of memory adjustments. By quantifying both the potential performance gain from allocating new containers and the performance loss from removing existing ones, FaaShadow makes data-driven reallocation decisions that maximize the global warm start rate. Experimental results show that FaaShadow achieves a 95% warm start rate using only 60% of the memory required by the best-in-class baseline. When paired with our dynamic scaling mechanism, FaaShadow reduces average memory consumption by a staggering 81.71% compared to the SOTA predictive scaler, while upholding performance targets.
Yili Gong, Xinquan Cai, Qianlong Sang, Tianheng Lu, Chuang Hu, Dazhao Cheng
IEEE Trans. Computers4