RDMA is Turing complete, we just did not know it yet!
Waleed Reda, Université catholique de Louvain (UCL) and the Royal Institute of Technology (KTH)
It is becoming increasingly popular for distributed systems to exploit offload to reduce load on the CPU. Remote Direct Memory Access (RDMA) offload, in particular, has become popular. However, RDMA still requires CPU intervention for complex offloads that go beyond simple remote memory access. As such, the offload potential is limited and RDMA-based systems usually have to work around such limitations.

We present RedN, a principled, practical approach to implementing complex RDMA offloads, without requiring any hardware modifications. Using self-modifying RDMA chains, we lift the existing RDMA verbs interface to a Turing complete set of programming abstractions. We explore what is possible in terms of offload complexity and performance with a commodity RDMA NIC. We show how to integrate these RDMA chains into applications, such as the Memcached key-value store, allowing us to offload complex tasks such as key lookups. RedN can reduce the latency of key-value get operations by up to 2.6× compared to state-of-the-art KV designs that use one-sided RDMA primitives (e.g., FaRM-KV), as well as traditional RPC-over-RDMA approaches. Moreover, compared to these baselines, RedN provides performance isolation and, in the presence of contention, can reduce latency by up to 35× while providing applications with failure resiliency to OS and process crashes.

Please email for a Zoom link
About the speaker
Waleed is a final year PhD student pursuing a joint degree at KTH Royal Institute of Technology and UCLouvain. His research interests are in the intersection of distributed systems and networks. Most of his work has focused on designing ultra low-latency distributed file systems that leverage state-of-the-art storage and networking hardware [OSDI'20, SOSP'21]. His most recent work explores how to turn commodity NICs into general-purpose processors to exploit their computational power [NSDI'22].
Date & Time
Thursday, July 21, 2022 - 14:00