wBPF: Efficient Edge-Case Observability for CXL Pooling systems via eBPF

Today's distributed tracing frameworks struggle to efficiently detect rare edge-case anomalies in large-scale heterogeneous systems employing Compute Express Link (CXL) for memory pooling.Traditional methods-head sampling, which often overlooks critical events, and tail sampling, which incurs significant overhead-fail to balance precision and performance effectively.We introduce wBPF, a lightweight tracing runtime tailored specifically for efficient edgecase observability in CXL-based memory disaggregation.Built upon eBPF, wBPF coordinates tracing across heterogeneous nodes, selectively captures critical memory anomalies, and significantly reduces communication overhead.It integrates container-level deployment, large language models (LLMs) and dynamic runtime verification, enabling rapid identification and resolution of complex memory management issues.Our evaluation shows that wBPF substantially improves edge-case observability with minimal performance impact, making it a valuable tool for troubleshooting memory pooling architectures in modern cloud-native infrastructures.

Authors

Institutions

Publication Details

Published
2025-03-30
DOI
https://doi.org/10.1145/3723851.3726985
Citations
1
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

wBPF: Efficient Edge-Case Observability for CXL Pooling systems via eBPF

Andrew Quinn, Tong Yu, Yiwei Yang, Yusheng Zheng
1 citations
Formal Methods in Verification
1.50
article

wBPF: Efficient Edge-Case Observability for CXL Pooling systems via eBPF

Andrew Quinn, Tong Yu, Yiwei Yang, Yusheng Zheng
article en
1 citations

Abstract

Today's distributed tracing frameworks struggle to efficiently detect rare edge-case anomalies in large-scale heterogeneous systems employing Compute Express Link (CXL) for memory pooling.Traditional methods-head sampling, which often overlooks critical events, and tail sampling, which incurs significant overhead-fail to balance precision and performance effectively.We introduce wBPF, a lightweight tracing runtime tailored specifically for efficient edgecase observability in CXL-based memory disaggregation.Built upon eBPF, wBPF coordinates tracing across heterogeneous nodes, selectively captures critical memory anomalies, and significantly reduces communication overhead.It integrates container-level deployment, large language models (LLMs) and dynamic runtime verification, enabling rapid identification and resolution of complex memory management issues.Our evaluation shows that wBPF substantially improves edge-case observability with minimal performance impact, making it a valuable tool for troubleshooting memory pooling architectures in modern cloud-native infrastructures.

University of California, Santa Cruz (US)
Affordable and clean energy
Openalex Percentile: Top 17%
Formal Methods in Verification
1.50
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.