PRISM
- 26 October 2021
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles CD-ROM
Abstract
Remote Direct Memory Access (RDMA) has been used to accelerate a variety of distributed systems, by providing low-latency, CPU-bypassing access to a remote host's memory. However, most of the distributed protocols used in these systems cannot easily be expressed in terms of the simple memory READs and WRITEs provided by RDMA. As a result, designers face a choice between introducing additional protocol complexity (e.g., additional round trips) or forgoing the benefits of RDMA entirely. This paper argues that an extension to the RDMA interface can resolve this dilemma. We introduce the PRISM interface, which adds four new primitives: indirection, allocation, enhanced compare-and-swap, and operation chaining. These increase the expressivity of the RDMA interface, while still being implementable using the same underlying hardware features. We show their utility by designing three new applications using PRISM primitives, that require little to no server-side CPU involvement: (1) PRISM-KV, a key-value store; (2) PRISM-RS, a replicated block store; and (3) PRISM-TX, a distributed transaction protocol. Using a software-based implementation of the PRISM primitives, we show that these systems outperform prior RDMA-based equivalents.Keywords
This publication has 18 references indexed in Scilit:
- RDMA over Commodity Ethernet at ScalePublished by Association for Computing Machinery (ACM) ,2016
- Fast and general distributed transactions using RDMA and HTMPublished by Association for Computing Machinery (ACM) ,2016
- Fast in-memory transaction processing using RDMA and HTMPublished by Association for Computing Machinery (ACM) ,2015
- YCSB+T: Benchmarking web-scale transactional databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Benchmarking cloud serving systems with YCSBPublished by Association for Computing Machinery (ACM) ,2010
- The Google file systemPublished by Association for Computing Machinery (ACM) ,2003
- Efficient optimistic concurrency control using loosely synchronized clocksPublished by Association for Computing Machinery (ACM) ,1995
- Sharing memory robustly in message-passing systemsPublished by Association for Computing Machinery (ACM) ,1990
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979