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
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
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
Catalyzer: Sub-millisecond Startup for Serverless Computing with Initialization-less Booting
Du, D., Yu, T., Xia, Y., Zang, B., Yan, G., Qin, C., Wu, Q., & Chen, H. (2020) · Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3373376.3378512 · Cited by 281
IceBreaker: warming serverless functions better with heterogeneity
Roy, R. B., Patel, T., & Tiwari, D. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507750 · Cited by 233
FaasCache: keeping serverless computing alive with greedy-dual caching
Fuerst, A., & Sharma, P. (2021) · Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3445814.3446757 · Cited by 223
The knapsack problem: A survey
Salkin, H. M., & De Kluyver, C. A. (1975) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800220110 · Cited by 196
Popularity-aware greedy dual-size Web proxy caching algorithms
Jin, S., & Bestavros, A. (2002) · Proceedings 20th IEEE International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2000.840936 · Cited by 170
Program locality analysis using reuse distance
Zhong, Y., Shen, X., & Ding, C. (2009) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1552309.1552310 · Cited by 166
The State of Serverless Applications: Collection, Characterization, and Community Consensus
Eismann, S., Scheuner, J., van Eyk, E., Schwinger, M., Grohmann, J., Herbst, N. R., Abad, C. L., & Iosup, A. (2021) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2021.3113940 · Cited by 166
Cold Start in Serverless Computing: Current Trends and Mitigation Strategies
Vahidinia, P., Farahani, B., & Aliee, F. S. (2020) · IEEE International Conference on Omni-layer Intelligent Systems (COINS) · doi:10.1109/coins49042.2020.9191377 · Cited by 138
Serverless computing for container-based architectures
Pérez, A. G., Moltó, G., Caballer, M., & Calatrava, A. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.01.022 · Cited by 130
ENSURE: Efficient Scheduling and Autonomous Resource Management in Serverless Environments
Suresh, A., Somashekar, G., Varadarajan, A., Kakarla, V. R., Upadhyay, H., & Gandhi, A. (2020) · IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS) · doi:10.1109/acsos49614.2020.00020 · Cited by 92
Mitigating Cold Start Problem in Serverless Computing: A Reinforcement Learning Approach
Vahidinia, P., Farahani, B., & Aliee, F. S. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3165127 · Cited by 91
AQUATOPE: QoS-and-Uncertainty-Aware Resource Management for Multi-stage Serverless Workflows
Zhou, Z., Zhang, Y., & Delimitrou, C. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3567955.3567960 · Cited by 90
With Great Freedom Comes Great Opportunity: Rethinking Resource Allocation for Serverless Functions
Bilal, M., Canini, M., Fonseca, R., & Rodrigues, R. (2023) · European Conference on Computer Systems · doi:10.1145/3552326.3567506 · Cited by 79
RainbowCake: Mitigating Cold-starts in Serverless with Layer-wise Container Caching and Sharing
Yu, H., Roy, R. B., Fontenot, C., Tiwari, D., Li, J., Zhang, H., Wang, H., & Park, S. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3617232.3624871 · Cited by 75
A Minimal Algorithm for the Bounded Knapsack Problem
Pisinger, D. (2000) · INFORMS journal on computing · doi:10.1287/ijoc.12.1.75.11898 · Cited by 73
Understanding, predicting and scheduling serverless workloads under partial interference
Zhao, L., Yang, Y., Li, Y., Zhou, X., & Li, K. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3476215 · Cited by 71
Replayable Execution Optimized for Page Sharing for a Managed Runtime Environment
Wang, K.-T. A., Ho, R., & Wu, P. (2019) · European Conference on Computer Systems · doi:10.1145/3302424.3303978 · Cited by 70
Memory deduplication for serverless computing with Medes
Saxena, D., Ji, T., Singhvi, A., Khalid, J., & Akella, A. (2022) · European Conference on Computer Systems · doi:10.1145/3492321.3524272 · Cited by 62
Efficient methods for calculating the success function of fixed-space replacement policies
Olken, F. (1981) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/6051879 · Cited by 62
Cross-Edge Orchestration of Serverless Functions With Probabilistic Caching
Chen, C., Herrera, M., Ge, Z., Xia, L., Ling, Z., & Wang, J. (2024) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2024.3399651 · Cited by 41
The Wonderless Dataset for Serverless Computing
Eskandani, N., & Salvaneschi, G. (2021) · International Conference on Mining Software Repositories (MSR) · doi:10.1109/msr52588.2021.00075 · Cited by 36
SIMPPO: a scalable and incremental online learning framework for serverless resource management
Qiu, H., Mao, W., Patke, A., Wang, C., Franke, H., Kalbarczyk, Z., Başar, T., & Iyer, R. K. (2022) · Symposium on Cloud Computing · doi:10.1145/3542929.3563475 · Cited by 25
Flame: A Centralized Cache Controller for Serverless Computing
Yang, Y., Zhao, L., Li, Y., Wu, S. C., Hao, Y., Ma, Y., & Li, K. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3623278.3624769 · Cited by 19
Concurrency-Informed Orchestration for Serverless Functions
Liu, Q., Cheng, Y., Shen, H., Wang, A., & Balaji, B. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3676641.3716253 · Cited by 8
SwitchFlow: Optimizing HPC Workflow Performance with Heterogeneous Serverless Frameworks
Chen, H., Dong, Y., Wen, X., & Xu, Z. (2024) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads63350.2024.00045 · Cited by 5
Online Container Caching for IoT Data Processing in Serverless Edge Computing
Li, G., Tan, H., Zhang, C., Zhang, X., Han, Z., & Chen, G. (2025) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2025.3595965 · Cited by 5
Edge AI-driven neural network predictions for replica sync optimization
Xu, Z., Dong, Y., Lou, J., Wang, Y., & Fu, Y. (2024) · Applied Soft Computing · doi:10.1016/j.asoc.2024.112083 · Cited by 3
Research works printed but not linked: 10
- 10.1145/3552326.3567506 · DOI
- Cidon, 2016, Cliffhanger: Scaling performance cliffs in web memory caches, 379
- Cidon, 2015, DynaCache: Dynamic cloud caching, 1
- Beckmann, 2018, LHD: Improving cache hit rate by maximizing hit density, 389
- Waldspurger, 2017, Cache modeling and optimization using miniature simulations, 487
- Martello, 1990, Knapsack Problems: Algorithms and Computer Implementations.
- Wang, 2018, Peeking behind the curtains of serverless platforms,” in, 133
- Mohan, 2019, Agile cold starts for scalable serverless, HotCloud, 2019, 3357034
- Oakes, 2018, {SOCK}: Rapid task provisioning with serverless-optimized containers, 57
- 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
- Licence
- 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
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.