Skip to content
Preprint

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

Aug 2026 · 0 citations · 29 references
Computer Science

TL;DR

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 application-level flexibility and hardware-level insights into scheduling and rescheduling decisions.

Abstract

Workload scheduling in cloud environments often relies on simplistic assumptions about application resource needs and hardware utilization. Overlooking application-level performance objectives and hardware resource contention that leads to inefficient resource usage and degraded performance. This paper addresses two key limitations of current approaches. First, unnecessarily strict enforcement of service level objectives (SLOs) often leads to resource underutilization and poor energy efficiency. Second, lack of congestion awareness in shared resources such as last-level cache (LLC) and memory bandwidth. In this paper, we propose two complementary strategies to address these limitations: (i) integrating soft SLO limits that allow controlled overcommitment and tolerate minor, transient violations to improve cluster efficiency, and (ii) introducing resource-aware scheduling and rescheduling based on real-time congestion insights for shared resources such as last-level cache (LLC) and memory bandwidth. Our results show that soft SLO limits reduce corrective rescheduling actions by 49% compared to hard-limit approaches while maintaining acceptable performance guarantees. Additionally, resource-aware scheduling decreases node-level congestion by 8% and further mitigates SLO violations, demonstrating the effectiveness of incorporating application-level flexibility and hardware-level insights into scheduling and rescheduling decisions.

View source

Similar papers

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
Book Open access Jul 2026

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

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.

Runfu Li, Zishu Yu, Yifan Wang et al. · 0 citations
Jul 2026

Task-aware dynamic optimization for edge cloud systems

TADOF is a dynamic optimization framework that jointly performs energy-aware elastic scaling and task migration under drift-aware periodic modeling and burst detection and observed about 18–34% lower energy and 15–28% lower migration cost than threshold and A2C/TD3 baselines while preserving QoS.

Juan Guo, Yanqun Zuo, Zhixian Chang · 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
Open access Aug 2026

Job-Level Dynamic Cache Allocation for Real-Time Systems under Shared LLC Interference

This paper introduces a job-level dynamic cache allocation strategy for multicore systems in which critical real-time tasks execute on a dedicated core while sharing the LLC with best-effort workloads executing on the remaining cores.

Michaël Lauer, Aléxis Génèrès, Jean-Charles Fabre · 0 citations
Preprint Aug 2026

Performance and Cost-Aware Cache Provisioning

This paper presents a novel hybrid segmented policy that reduces capacity requirements while keeping processing costs low and shows that dynamically adjusting the segment ratio in segmented policies based on historical workload patterns enhances efficiency.

R. Tanvir, G. Kesidis · 0 citations

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