Detecting Noisy Neighbors in CPU-Isolated Cgroups Environments

Control groups (cgroups) are a crucial isolation mechanism in containerized environments, but they don't fully prevent performance interference (noisy neighbors). This paper presents a novel, workload-agnostic approach for detecting noisy neighbors within CPU-isolated cgroups. Using in-kernel profiling with Extended Berkeley Packet Filter (eBPF), we instrument the Linux process scheduler to capture scheduling latencies and preemption frequencies. We introduce a detection method based on these metrics to identify noisy neighbors online without requiring workload profiles or offline analysis. Evaluations across various workload scenarios demonstrate the effectiveness of our approach in accurately identifying performance degradation caused by noisy neighbors.

Authors

Institutions

Publication Details

Published
2025-05-03
DOI
https://doi.org/10.1145/3676151.3719376
Citations
1
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Detecting Noisy Neighbors in CPU-Isolated Cgroups Environments

Stefan Wesner, Jörg Domaschka, Sascha Winkelhofer, Simon Volpert
1 citations
Graph Theory and Algorithms
1.28
article

Detecting Noisy Neighbors in CPU-Isolated Cgroups Environments

Stefan Wesner, Jörg Domaschka, Sascha Winkelhofer, Simon Volpert
article en
1 citations

Abstract

Control groups (cgroups) are a crucial isolation mechanism in containerized environments, but they don't fully prevent performance interference (noisy neighbors). This paper presents a novel, workload-agnostic approach for detecting noisy neighbors within CPU-isolated cgroups. Using in-kernel profiling with Extended Berkeley Packet Filter (eBPF), we instrument the Linux process scheduler to capture scheduling latencies and preemption frequencies. We introduce a detection method based on these metrics to identify noisy neighbors online without requiring workload profiles or offline analysis. Evaluations across various workload scenarios demonstrate the effectiveness of our approach in accurately identifying performance degradation caused by noisy neighbors.

University of Cologne (DE)
Openalex Percentile: Top 21%
Graph Theory and Algorithms
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Detecting Noisy Neighbors in CPU-Isolated Cgroups Environments — Stefan Wesner, Jörg Domaschka, et al. · (2025) | TGRS Research Map | TGRS