Storm: a fast transactional dataplane for remote data structures

February 06, 2019 Β· Declared Dead Β· πŸ› Annual Haifa Experimental Systems Conference

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Stanko Novakovic, Yizhou Shan, Aasheesh Kolli, Michael Cui, Yiying Zhang, Haggai Eran, Liran Liss, Michael Wei, Dan Tsafrir, Marcos Aguilera arXiv ID 1902.02411 Category cs.DC: Distributed Computing Citations 79 Venue Annual Haifa Experimental Systems Conference Last Checked 5 months ago
Abstract
RDMA is an exciting technology that enables a host to access the memory of a remote host without involving the remote CPU. Prior work shows how to use RDMA to improve the performance of distributed in-memory storage systems. However, RDMA is widely believed to have scalability issues, due to the amount of active protocol state that needs to be cached in the limited NIC cache. These concerns led to several software-based proposals to enhance scalability by trading off performance. In this work, we revisit these trade-offs in light of newer RDMA hardware and propose new guidelines for scaling RDMA. We show that using one-sided remote memory primitives leads to higher performance compared to send/receive and kernel-based systems in rack-scale environments. Based on these insights, we design and implement Storm, a transactional dataplane using one-sided read and write-based RPC primitives. We show that Storm outperforms eRPC, FaRM, and LITE by 3.3x, 3.6x, and 17.1x, respectively, on an Infinband EDR cluster with Mellanox ConnectX-4 NICs.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted