Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.

Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State

Gong, Yili, Cai, Xinquan, Sang, Qianlong, Lu, Tianheng, Hu, Chuang, Cheng, Dazhao · 2026 · IEEE Transactions on Computers

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.

Overview

Integrity signals

Registry

Crossref · 10.1109/tc.2026.3699453

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 28 references

Research works printed but not linked: 10

  1. 10.1145/3552326.3567506 · DOI
  2. Cidon, 2016, Cliffhanger: Scaling performance cliffs in web memory caches, 379
  3. Cidon, 2015, DynaCache: Dynamic cloud caching, 1
  4. Beckmann, 2018, LHD: Improving cache hit rate by maximizing hit density, 389
  5. Waldspurger, 2017, Cache modeling and optimization using miniature simulations, 487
  6. Martello, 1990, Knapsack Problems: Algorithms and Computer Implementations.
  7. Wang, 2018, Peeking behind the curtains of serverless platforms,” in, 133
  8. Mohan, 2019, Agile cold starts for scalable serverless, HotCloud, 2019, 3357034
  9. Oakes, 2018, {SOCK}: Rapid task provisioning with serverless-optimized containers, 57
  10. Akkus, 2018, {SAND}: Towards high-performance serverless computing, 923

Cited by

Still being checked.

Metadata

Authors
Gong, Y., Cai, X., Sang, Q., Lu, T., Hu, C., & Cheng, D.
Affiliations
  • Wuhan University (CN)
  • University of Macau (MO)
Venue
IEEE Transactions on Computers
Published
2026-08
Volume
75
Issue
8
Pages
2929-2942
ISSN
  • 0018-9340 (ISSN-L)
  • 1557-9956
  • 2326-3814
OpenAlex
W7163166869
Cited by
0
References
28
FWCI
0.00
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Computers (publishedVersion)
Funders
  • National Natural Science Foundation of China (62341410, 62302348)
  • National Key Research and Development Program of China (2023YFE0205700)
  • State Key Laboratory of Internet of Things for Smart City (University of Macau) Open Research Project (SKL-IOTSC(UM)/ORPO5/2025)
Topics
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
  • Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
Keywords
function-as-a-service, dynamic scaling

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State. https://app.cochat.ai/papers/10.1109/tc.2026.3699453
The paper
Gong, Y., Cai, X., Sang, Q., Lu, T., Hu, C., & Cheng, D. (2026). Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2026.3699453

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.