Skip to content

Achieving Wire-Latency Storage Systems by Exploiting Hardware ACKs (Juneberry)#

NSDI '25 digest Program Core pick 28–30 April 2025

Abstract Paper Slides Recording

Play the recording: Achieving Wire-Latency Storage Systems by Exploiting Hardware ACKs (Juneberry)

  • Why: Touches RDMA datapath internals directly: it questions whether storage requests need a full RPC round trip plus server-CPU involvement to commit, which is relevant to anyone designing lossless-fabric storage paths.
  • What: Juneberry gives storage requests a fast path that commits in a single round trip while bypassing the server CPU, with request execution happening asynchronously on the server afterward.
  • How: An "Ordered Queue" abstraction treats the NIC's hardware ACK as the commit signal while preserving linearizability; durability comes from landing requests in persistent memory. Built on commodity RDMA NICs and integrated into Memcached and PMemKV, with significantly lower latency than RPC under write-intensive workloads.
  • Where applicable: RDMA + persistent-memory storage deployments on commodity RNICs. General mechanism, but the durability story assumes PM availability.