YoVDO

RDMA Is Turing Complete, We Just Did Not Know It Yet

Offered By: USENIX via YouTube

Tags

USENIX Symposium on Networked Systems Design and Implementation (NSDI) Courses Distributed Systems Courses Memcached Courses

Course Description

Overview

Explore the groundbreaking discovery of Remote Direct Memory Access (RDMA) Turing completeness in this 18-minute conference talk from NSDI '22. Dive into RedN, a novel approach for implementing complex RDMA offloads without hardware modifications, using self-modifying RDMA chains. Learn how this technique lifts the existing RDMA verbs interface to a Turing complete set of programming abstractions, enabling offload of complex tasks like key lookups in distributed systems. Discover the potential performance improvements, including reduced latency for key-value get operations, enhanced performance isolation, and failure resiliency. Gain insights into the evaluation of RedN, its application in Memcached lookups, and the significant latency reductions achieved in both normal and contentious scenarios.

Syllabus

Intro
Benefits of RDMA networking
Massive growth in RDMA processing po
Existing designs for RDMA-based syste Commodity RNIC offloads
Alternative Design: Exploit RNIC Processing PL
Alternative Design: Exploit RNIC Processing Power
Conditional Branching - is it possible?
Branching with Self-Modifying Code
What about loops?
RedN Framework - Overview
Evaluation
Use case: Memcached Lookups
Results: Memcached get latency
Results: Memcached get contention
Conclusion


Taught by

USENIX

Related Courses

Advanced Operating Systems
Georgia Institute of Technology via Udacity
High Performance Computing
Georgia Institute of Technology via Udacity
GT - Refresher - Advanced OS
Georgia Institute of Technology via Udacity
Distributed Machine Learning with Apache Spark
University of California, Berkeley via edX
CS125x: Advanced Distributed Machine Learning with Apache Spark
University of California, Berkeley via edX