• Corpus ID: 238259028

Spindle: Techniques for Optimizing Atomic Multicast on RDMA

  title={Spindle: Techniques for Optimizing Atomic Multicast on RDMA},
  author={Sagar Jha and Lorenzo Rosa and Kenneth P. Birman},
Modern networking technologies such as Remote Direct Memory Access (RDMA) promise huge speedups in I/O bound platforms, but software layering overheads must first be overcome. Our paper studies this issue in a system that replicates small data objects using atomic multicast: a case in which internal synchronization is unavoidable, and any delay will be particularly impactful. Spindle, the methodology we propose, entails a series of optimizations including memory polling integrated with novel… 
Nezha: Deployable and High-Performance Consensus Using Synchronized Clocks
This work presents Nezha, a high-performance and deployable consensus protocol that exploits accurate software clock synchronization and does not require special hardware or physical network access, making it easily deployable in virtu-alized environments.
Cascade: An Edge Computing Platform for Real-time Machine Intelligence (Invited paper)
Cornell’s Cascade project seeks to close the gap by creating a new platform for hosting ML and AI, optimized to achieve sharply lower delay and substantially higher bandwidth than in any existing platform.


RDMC: A Reliable RDMA Multicast for Large Objects
The system, RDMC (RDMA Multicast), offers reliable multicast functionality constructed from RDMA unicast, and discusses design choices, present a theoretical analysis of RDMC's robustness to delays and slow network links, and reports on experiments that evaluate RDMC over Mellanox RDMA.
IX: A Protected Dataplane Operating System for High Throughput and Low Latency
IX is presented, a dataplane operating system that provides high I/O performance, while maintaining the key advantage of strong protection offered by existing kernels, and outperforms Linux and state-of-the-art, user-space network stacks significantly in both throughput and end-to-end latency.
APUS: fast and scalable paxos on RDMA
This paper presents APUS, the first RDMA-based Paxos protocol that aims to be fast and scalable to client connections and hosts, and evaluated APUS on nine widely-used server programs.
DARE: High-Performance State Machine Replication on RDMA Networks
A new set of protocols based on Remote Direct Memory Access (RDMA) primitives, using a strongly consistent key-value store, are proposed that enable operators to fully utilize the new capabilities of the quickly growing number of RDMA-capable datacenter networks.
FaRM: Fast Remote Memory
We describe the design and implementation of FaRM, a new main memory distributed computing platform that exploits RDMA to improve both latency and throughput by an order of magnitude relative to
Odyssey: the impact of modern hardware on strongly-consistent replication protocols
Odyssey is presented, a framework tailored towards protocol implementation for multi-threaded, RDMA-enabled, in-memory, replicated KVSes, and the first apples-to-apples comparison of replication protocols over modern hardware is performed.
The Impact of RDMA on Agreement
It is found that RDMA can improve the inherent trade-off in distributed computing between failure resilience and performance, and allow algorithms that simultaneously achieve high resilience and high performance, while traditional algorithms had to choose one or another.
The multikernel: a new OS architecture for scalable multicore systems
This work investigates a new OS structure, the multikernel, that treats the machine as a network of independent cores, assumes no inter-core sharing at the lowest level, and moves traditional OS functionality to a distributed system of processes that communicate via message-passing.
Deconstructing RDMA-enabled Distributed Transactions: Hybrid is Better!
DrTM+H is built, a new hybrid distributed transaction system that always embraces the optimal RDMA primitives at each phase of transactional execution, and conducts an end-to-end comparison of prior designs on the same codebase and finds none of them is optimal.
FaSST: Fast, Scalable and Simple Distributed Transactions with Two-Sided (RDMA) Datagram RPCs
FaSST eschews one-sided RDMA for fast RPCs using two-sided unreliable datagrams, which provides better performance, scalability, and simplicity, without requiring expensive reliability mechanisms in software.