paperbot · PL 论文追踪

全部论文 待读 收藏

P2 RPCValet

RPCValet:面向集成网络接口的 RPC 负载均衡
ASPLOS Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems2019匹配度 0/10 · 论文研究网络接口驱动的RPC负载均衡与微秒级尾延迟优化,属于系统/体系结构与网络方向,不涉及静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析,与用户研究画像无交集。引用 41 inbox
Alexandros Daglis, Mark Sutherland, Babak Falsafi
crossref: 2026-09-12

AI 速览

一句话:提出由网络接口驱动的 RPC 负载均衡设计,以近最优尾延迟调度多核服务器上的微秒级 RPC。

现代在线服务对响应尾延迟要求严苛,且细粒度软件分层使单次用户请求扇出大量微秒级 RPC,加剧了对更快跨服务器通信与高效负载均衡的需求。硬件终止的用户级协议(如 InfiniBand/RDMA)与集成网络接口(NI)的出现,为 NI 驱动的 RPC 分派提供了新机会。本文提出 RPCValet,一种面向此类架构的 RPC 负载均衡设计,其分派决策模拟理论最优的单队列系统,同时避免单队列实现通常的同步开销。实验表明,相较于当前具备 RPC 负载分发硬件支持的系统,RPCValet 在严格尾延迟目标下将吞吐提升至多 1.4 倍,并将 μs 级 RPC 在饱和前的尾延迟降低至多 4 倍,且性能距理论最优单队列系统 15% 以内。

问题
现代在线服务要求严格的尾延迟,而细粒度软件分层使单个用户请求扇出大量微秒级 RPC,因此需要更快的跨服务器通信与多核服务器上的高效 RPC 负载均衡。
方法
RPCValet 利用硬件终止的用户级协议与集成网络接口,由 NI 驱动地将 RPC 分派到多核服务器各核心,并通过模拟理论最优单队列系统的分派决策来避免同步开销。
评估
在与具备 RPC 负载分发硬件支持的现有系统对比中,RPCValet 在严格尾延迟目标下将吞吐提升至多 1.4 倍,将 μs 级 RPC 饱和前的尾延迟降低至多 4 倍,并达到理论最优单队列系统 15% 以内的性能。
原文摘要(Abstract)

Modern online services come with stringent quality requirements in terms of response time tail latency. Because of their decomposition into fine-grained communicating software layers, a single user request fans out into a plethora of short, μs-scale RPCs, aggravating the need for faster inter-server communication. In reaction to that need, we are witnessing a technological transition characterized by the emergence of hardware-terminated user-level protocols (e.g., InfiniBand/RDMA) and new architectures with fully integrated Network Interfaces (NIs). Such architectures offer a unique opportunity for a new NI-driven approach to balancing RPCs among the cores of manycore server CPUs, yielding major tail latency improvements for μs-scale RPCs. We introduce RPCValet, an NI-driven RPC load-balancing design for architectures with hardware-terminated protocols and integrated NIs, that delivers near-optimal tail latency. RPCValet's RPC dispatch decisions emulate the theoretically optimal single-queue system, without incurring synchronization overheads currently associated with single-queue implementations. Our design improves throughput under tight tail latency goals by up to 1.4x, and reduces tail latency before saturation by up to 4x for RPCs with μs-scale service times, as compared to current systems with hardware support for RPC load distribution. RPCValet performs within 15% of the theoretically optimal single-queue system.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot4912,
  title = {RPCValet},
  author = {Alexandros Daglis and Mark Sutherland and Babak Falsafi},
  booktitle = {ASPLOS},
  year = {2019},
  doi = {10.1145/3297858.3304070}
}