Skip to content
Preprint

Serverless platform driven CPU loadbalancing

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

This paper presents a serverless platform-driven CPU load balancing framework that enables the control plane to directly influence CPU scheduling through a custom Linux scheduler built on SchedExt(SCX).

Abstract

Serverless platforms maintain a global view of function invocations and resource utilization, yet existing systems largely restrict CPU scheduling decisions to the operating system scheduler. This paper presents a serverless platform-driven CPU load balancing framework that enables the control plane to directly influence CPU scheduling through a custom Linux scheduler built on SchedExt(SCX). The proposed scheduler introduces configurable scheduling domains and a shared interface that allows the control plane to assign functions to domains based on their historical inter-arrival times. Within each domain, a single-queue load-balancing strategy combined with a virtual-time prioritization policy improves task placement while reducing interference from busy-polling tasks. Results show that an eight-domain configuration achieves the best trade-off, reducing system energy consumption by approximately 15% while increasing invocation cost by only 5%. Under heavily loaded workloads, the proposed scheduler also reduces request latency by up to 50% compared to the default Linux Completely Fair Scheduler (CFS). These results demonstrate that exposing CPU scheduling decisions to the serverless control plane can improve both energy efficiency and workload performance while preserving scheduling flexibility.

View source

Similar papers

Open access Aug 2026

Kernel-Level Dynamic Priority Scheduling for Containers

A dynamic priority scheduling framework at the kernel level that enhances the CPU allocation to latency-sensitive containers running in Kubernetes environments and reveals a significant improvement in terms of latency reduction, enhanced throughput, efficient utilization of CPU resources, and stable performance of sche...

T. Rajkumar, Nishanth D., P. M et al. · 0 citations
Conference Jul 2026

Load-Aware Adaptive Scheduling (LAAS) System: A Real-Time CPU Scheduler for Minimal Operating System Kernels

Adaptive CPU scheduling that responds to dynamic workload characteristics remains an open challenge for minimal operating systems. Traditional schedulers employ static parameters unsuitable for heterogeneous workloads, while recent machine learning approaches incur overhead inappropriate for resource-constrained enviro...

Durgesh Kumar, Aviskha Talukdar, Nandani et al. · 0 citations
Preprint Aug 2026

A Kubernetes Scheduler Plugin for Cluster-Wide Placement Optimisation

The default scheduler of Kubernetes, the state-of-the-art container orchestrator, uses fast, local placement decisions. Unfortunately, this design leads to resource fragmentation, reduced cluster usage, and overprovisioning. External solvers can compute global placement plans, but enforcing these plans in upstream clus...

Henrik Christensen, Saverio Giallorenzo, J. Mauro · 0 citations

Future Generation Computer Systems

Concord, a novel GPU sharing-enabled workload scheduler that outperforms state-of-the-art schedulers, achieves a 1.68 × reduction in JCT and a 29% improvement in GPU utilization in high-load scenarios.

Xin-Hua Wang, Wei-Wei Lin, Hai-Jie Wu et al. · 0 citations
Jul 2026

Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads

Lightweight thread scheduling is optimal for shared-memory row sorting, while AIMD/adaptive scheduling and pipe-based process scheduling remain valuable for contention-aware execution, explicit inter-process coordination, and distributed-style heterogeneous workload management.

Mejgan Dedaj, Argyro Gailla, T. Ioannou et al. · 0 citations
Conference Aug 2026

ARDA: I/O Scheduler for Heterogeneous Workloads Co-located on Ultra-low-latency SSDs

Ultra-low-latency (ULL) SSDs enable cloud service providers to co-locate latency-sensitive services and throughputoriented background jobs on the same machines. However, their microsecond-scale latency creates a scheduling dilemma: conventional I/O schedulers introduce visible overhead, while disabling scheduling remov...

Ming Wei, Tzu-Chieh Huang, Chieh-Lin Tsai 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.