Organizations: University of California, Los Angeles, Los Angeles, USA · University of California, Berkeley, Berkeley, USA · New York University, New York, USA · Independent Researcher, Mukilteo, USA · Fordham University, New York, USA · Independent Researcher, Washington, USA
Serverless computing eliminates infrastructure management overhead but introduces significant challenges regarding cold start latency and resource utilization. Traditional static resource allocation often leads to inefficiencies under variable workloads, resulting in performance degradation or excessive costs. This paper presents an adaptive engineering framework that optimizes serverless performance through event-driven architecture and probabilistic modeling. We propose a dual-strategy mechanism that dynamically adjusts idle durations and employs an intelligent request waiting strategy based on slot survival predictions. By leveraging sliding window aggregation and asynchronous processing, our system proactively manages resource lifecycles. Experimental results show that our approach reduces cold starts by up to 51.2% and improves cost-efficiency by nearly 2x compared to baseline methods in multi-cloud environments.
Figures & tables
Figure 1: System architecture overview showing the five-layer design from request sources through the core optimization engine to resource allocation decisions.
Figure 2: Dynamic resource lifecycle management showing state transitions and adaptive parameter formulations for idle duration, wait probability, and online learning.
Figure 3: Data preprocessing pipeline visualization. (a) Multi-resolution temporal analysis showing four aggregation metrics computed from adaptive time bins over a 24-hour period, revealing distinct activity patterns during peak hours and burst events. (b) Request categorization results via online clustering and incremental PCA, identifying five resource consumption profiles with 95% confidence ellipses.
Figure 4: Training convergence of different methods across three workload patterns. Columns represent four evaluation metrics: Cold Start Reduction Rate (CSRR), Resource Utilization Efficiency (RUE), Adaptive Response Latency (ARL), and Cost-Performance Index (CPI). Rows correspond to Dataset-1 (high-frequency uniform), Dataset-2 (periodic burst), and Dataset-3 (irregular sparse). ASRM (Ours) demonstrates faster convergence and superior final performance across all configurations.
Method
CSRR
RUE
ARL
CPI
Dataset-1: High-frequency Uniform Workload
OpenWhisk-Default
0.000
0.423
0.872
1.000
SOCK
0.284
0.512
0.658
1.342
Firecracker-snap
0.317
0.538
0.621
1.428
Knative-KPA
0.256
0.487
0.734
1.218
ASRM (Ours)
0.512
0.687
0.421
1.876
Table 1: Performance Comparison Across Different Workload Patterns
Serverless computing simplifies cloud deployment but introduces new challenges in managing service latency and carbon emissions. Reducing cold-start latency requires retaining warm function instances, while minimizing carbon emissions favors reclaiming idle resources. This balance is further complicated by time-varying grid carbon intensity and varying workload patterns, under which static keep-alive policies are inefficient. We present LACE-RL, a latency-aware and carbon-efficient management framework that formulates serverless pod retention as a sequential decision problem. LACE-RL uses deep reinforcement learning to dynamically tune keep-alive durations, jointly modeling cold-start probability, function-specific latency costs, and real-time carbon intensity. Using the Huawei Public Cloud Trace, we show that LACE-RL reduces cold starts by 51.69% and idle keep-alive carbon emissions by 77.08% compared to Huawei's static policy, while achieving better latency-carbon trade-offs than state-of-the-art heuristic and single-objective baselines, approaching Oracle performance.
Bowen Sun, Christos D. Antonopoulos, Evgenia Smirni +3
Department of Computer Science, William & Mary, Williamsburg, VA, USA · Department of Computer Science, University of Thessaly, Volos, Greece
In edge computing, the stochastic and bursty nature of serverless workloads challenges autonomous resource orchestration. Traditional reactive controllers, such as the Kubernetes Horizontal Pod Autoscaler (HPA), suffer from reaction latency, leading to Service Level Objective (SLO) violations during traffic spikes and resource flapping during ramp-downs. While Deep Reinforcement Learning (DRL) offers a pathway toward proactive management, standard agents suffer from temporal blindness, an inability to exploit the recent temporal context in non-Markovian edge environments. To bridge this gap, we propose a stability-aware autoscaling framework unifying short-horizon temporal context and control via an Attention-Enhanced Double-Stacked LSTM architecture integrated within a Proximal Policy Optimization (PPO) agent. Unlike shallow recurrent models, our approach employs a learned attention mechanism that weights recent historical states non-uniformly, suppressing high-frequency jitter while preserving the trend that precedes demand shifts. We validate the framework on two independent Kubernetes clusters using real-world Azure Functions traces. Against the single-layer LSTM ablation and the static HPA baseline, our approach reduces P90 latency by ≈67%, and holds average latency within the 50ms hard SLO for 98.8% of the run against 49.6% and 43.5% respectively. Against Kubernetes Event-Driven Autoscaling (KEDA), it matches latency performance at 75% fewer replica-steps and 59% less churn, with P90 hard-SLO violation bursts of at most 5 consecutive intervals against up to 24 for KEDA. These results indicate that mitigating temporal blindness through deep attentive memory improves the reliability and stability of Kubernetes autoscaling under bursty edge workloads.
Faraz Shaikh, Gianluca Reali, Mauro Femminella
Department of Engineering, University of Perugia, Perugia, Italy · Consorzio Nazionale Interuniversitario per le Telecomunicazioni (CNIT), 43124 Parma, Italy
Cloud computing allows scalable resource provisioning, but dynamic workload changes often lead to higher costs due to over-provisioning. Machine learning (ML) approaches, such as Long Short-Term Memory (LSTM) networks, are effective for predicting workload patterns at a higher level, but they can introduce delays during sudden traffic spikes. In contrast, mathematical heuristics like Game Theory provide fast and reliable scheduling decisions, but they do not account for future workload changes. To address this trade-off, this paper proposes a hybrid orchestration framework that combines LSTM-based predictive scaling with heuristic task allocation. The results show that this approach reduces infrastructure costs close to ML-based models while maintaining fast response times similar to heuristic methods. This work presents a practical approach for improving cost efficiency in cloud resource management.
Heet Nagoriya, Komal Rohit
Information Technology G H Patel College of Engineering and Technology Anand, India