Skip to content
Book Open access

Enabling High-Utilization and Low-Contention FaaS: A Request-Level Resource Provisioning Approach

Jul 2026 · IEEE International Symposium on High-Performance Parallel Distributed Computing · 0 citations · 58 references
Computer Science

TL;DR

This paper advocates a shift to request-level resource provisioning, which redefines the individual request as the atomic unit for scheduling and resource management, and implements this approach in RRP, a scalable FaaS platform that enables efficient per-request resource allocation and release.

Abstract

Function-as-a-Service offers cost efficiency but often suffers from resource underutilization. This underutilization stems from the instance-level resource provisioning pattern, an issue that existing optimizations have failed to resolve fundamentally. The core problem is that static coarse-grained instance-level resource allocation cannot match the millisecond-level burstiness of dynamic requests. Consequently, it is difficult for current systems to achieve high resource utilization while maintaining high quality of service (QoS) guarantees. To address the problem, this paper advocates a shift to request-level resource provisioning, which redefines the individual request as the atomic unit for scheduling and resource management. We implement this approach in RRP, a scalable FaaS platform that enables efficient per-request resource allocation and release. RRP unifies instance placement and request routing with low-overhead, millisecond-level global visibility. Our evaluation shows that RRP significantly outperforms state-of-the-art instance-level platforms and algorithms. By matching resources to each request’s needs and isolating them from contention, RRP achieves low latency and high utilization. Specifically, on real-world Azure traces, RRP achieves speedups of 1.33 × –30.15 × for average end-to-end latency and 1.37 × –61.46 × for P99 latency, and raises CPU utilization from 44.80%–56.32% to 72.49% under bursty loads.

Read PDF

Similar papers

Preprint Aug 2026

Beyond the Limits: Flexible and Congestion-Aware Cluster Scheduling for the Cloud

The results show that soft SLO limits reduce corrective rescheduling actions by 49% compared to hard-limit approaches while maintaining acceptable performance guarantees, and resource-aware scheduling decreases node-level congestion and further mitigates SLO violations, demonstrating the effectiveness of incorporating...

Oliver Larsson, Thijs Metsch, Cristian Klein et al. · 0 citations
Conference Jul 2026

Two-level Network Bandwidth Allocation for Multi-tenant AI Clouds in Kubernetes

Compute and memory resources in cloud environments are strictly managed and isolated by the control plane; in contrast, network resources lack equivalent management and isolation mechanisms. This best-effort treatment of networking leads to significant challenges for modern AI workloads, which have diverse and bandwidt...

Sunyanan Choochotkaew, Lionel Jouin, Tatsuhiro Chiba · 0 citations
Open access Aug 2026

Hierarchical Scheduler with Adaptive Time-Budget Reallocation for Time-Triggered Edge-Fog-Cloud Architectures

The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, res...

Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al. · 0 citations
Book Open access Sep 2026

μslice: Toward Accurate Sub-Core Allocation with eBPF

An eBPF-based scheduling framework is designed and implemented that complements existing kernel mechanisms to improve the accuracy of fine-grained CPU allocation while maintaining low overhead and demonstrates that the proposed approach significantly reduces resource overallocation and performance variability compared...

Chang-Yuan Lin, Mohammad Shahrad · 0 citations
Open access 2026

SLA-DE-RALBA: Cost-efficient dynamic enhanced resource-aware load balancing algorithm for cloud computing

An SLA-aware Dynamic Enhanced Resource-Aware Load Balancing Algorithm (SLADE- RALBA) that minimizes load imbalance by considering the computational capacities of virtual machines and ensures Service Level Agreement (SLA) compliance through a three-tier priority-based workflow is proposed.

Mohsin Nawaz, Altaf Hussain, Marran Al Qwaid et al. · 0 citations
Open access Jul 2026

SPES: A Stochastic Predictive Energy-Aware Scheduling Approach for Efficient Multi-Region Cloud Computing

Cloud computing has transformed the delivery of modern applications and services by providing scalable, flexible, and cost-effective access to computing resources. One of the most critical challenges in cloud environments is the efficient distribution of dynamic workloads across heterogeneous resources, commonly addres...

M. Yacoub, Ahmed E. Abdel Raouf, Walaa K. Gad et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.