Making Kernel Bypass Practical for the Cloud with Junction
Joshua Fried, Gohar Irfan Chaudhry, Enrique Saurez, Esha Choukse, Íñigo Goiri, Sameh Elnikety, Rodrigo Fonseca, Adam Belay
摘要
Kernel bypass systems have demonstrated order of magnitude improvements in throughput and tail latency for network-intensive applications relative to traditional operating systems (OSes). To achieve such excellent performance, however, they rely on dedicated resources (e.g., spinning cores, pinned memory) and require application rewriting. This is unattractive to cloud operators because they aim to densely pack applications, and rewriting cloud software requires a massive investment of valuable developer time. For both reasons, kernel bypass, as it exists, is impractical for the cloud.
In this paper, we show these compromises are not necessary to unlock the full benefits of kernel bypass. We present Junction, the first kernel bypass system that can pack thousands of instances on a machine while providing compatibility with unmodified Linux applications. Junction achieves high density through several advanced NIC features that reduce pinned memory and the overhead of monitoring large numbers of queues. It maintains compatibility with minimal overhead through optimizations that exploit a shared address space with the application. Junction scales to 19-62× more instances than existing kernel bypass systems and can achieve similar or better performance without code changes. Furthermore, Junction delivers significant performance benefits to applications previously unsupported by kernel bypass, including those that depend on runtime systems like Go, Java, Node, and Python. In a comparison to native Linux, Junction increases throughput by 1.6-7.0× while using 1.2-3.8× less cores across seven applications.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper27
- eTran: Extensible Kernel Transport with eBPFZhongjie Chen, Qingkai Meng, ChonLam Lao, Yifan Liu 等NSDI 2025 · 被引用 17 次
- Octopus: Enhancing CXL Memory Pods via Sparse TopologyYuhong Zhong, Fiodar Kazhamiaka, Pantea Zardoshti, Shuwei Teng 等NSDI 2026 · 被引用 15 次
- CEIO: A Cache-Efficient Network I/O Architecture for NIC-CPU Data PathsBowen Liu, Xinyang Huang, Qijing Li, Zhuobin Huang 等SIGCOMM 2025 · 被引用 10 次
- The Benefits and Limitations of User Interrupts for Preemptive Userspace SchedulingLinsong Guo, Danial Zuberi, Tal Garfinkel, Amy OusterhoutNSDI 2025 · 被引用 10 次
- Extended User Interrupts (xUI): Fast and Flexible Notification without PollingBerk Aydogmus, Linsong Guo, Danial Zuberi, Tal Garfinkel 等ASPLOS 2025 · 被引用 8 次
它引用的顶会 Paper10
- Caladan: Mitigating Interference at Microsecond TimescalesJoshua Fried, Zhenyuan Ruan, Amy Ousterhout, Adam BelayOSDI 2020 · 被引用 213 次
- Firecracker: Lightweight Virtualization for Serverless ApplicationsAlexandru Agache, Marc Brooker, Alexandra Iordache, Anthony Liguori 等NSDI 2020 · 被引用 197 次
- Benchmarking, analysis, and optimization of serverless function snapshotsDmitrii Ustiugov, Plamen Petrov, Marios Kogias, Edouard Bugnion 等ASPLOS 2021 · 被引用 162 次
- Unikraft: fast, specialized unikernels the easy waySimon Kuenzer, Vlad-Andrei Badoiu, Hugo Lefeuvre, Sharan Santhanam 等EuroSys 2021 · 被引用 116 次
- The Demikernel Datapath OS Architecture for Microsecond-scale Datacenter SystemsIrene Zhang, Amanda Raybuck, Pratyush Patel, Kirk Olynyk 等SOSP 2021 · 被引用 83 次
相关 Paper
- Opening Up Kernel-Bypass TCP StacksShinichi Awamoto, Michio HondaUSENIX ATC 2025 · 被引用 5 次
- Tigger: A Database Proxy That Bounces With User-BypassMatthew Butrovich, Karthik Ramanathan, John Rollinson, Wan Shen Lim 等VLDB 2023 · 被引用 17 次
- Pegasus: Transparent and Unified Kernel-Bypass Networking for Fast Local and Remote CommunicationDinglan Peng, Congyu Liu, Tapti Palit, Anjo Vahldiek-Oberwagner 等EuroSys 2025 · 被引用 6 次
- Understanding Host Network Stack LatencyTianyu Zuo, Jaehyun Hwang, Ao Tang, Rachit Agarwal 等SIGCOMM 2026
- DINT: Fast In-Kernel Distributed Transactions with eBPFYang Zhou, Xingyu Xiang, Matthew Kiley, Sowmya Dharanipragada 等NSDI 2024 · 被引用 40 次
