Herd

19,319 views

Published on

HERD

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
19,319
On SlideShare
0
From Embeds
0
Number of Embeds
17,411
Actions
Shares
0
Downloads
8
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Herd

  1. 1. Reading “Using RDMA Efficiently for Key-Value Services”[1] @syoyo Thursday, August 7, 14
  2. 2. Overview • KVS(GET/PUT) + RDMA • 26 million key-value op per second • 5 us average latency • 1 key-value item size <= 1024 bytes • 2x faster than previous method Thursday, August 7, 14
  3. 3. Previous work • Pilaf : C. Mitchell,Y. Geng, and J. Li. Using One-Sided RDMA Reads to Build a Fast, CPU-Efficient Key-Value Store. In USENIX ATC, 2013. • FaRM : A.Dragojevic,D.Narayanan,O.Hodson,andM.Castro. FaRM: Fast Remote Memory. In USENIX NSDI, 2014. • MICA: H. Lim, D. Han, D. G.Andersen, and M. Kaminsky. MICA:A Holistic Approach to Fast In- Memory Key-Value Storage. In USENIX NSDI, 2014. Thursday, August 7, 14
  4. 4. • Use RDMA WRITE instead of RDMA READ • Half round trip latency Thursday, August 7, 14
  5. 5. ServerClient Client RDMA WRITE UC RDMA WRITE UC polling SEND UD SEND UD Thursday, August 7, 14
  6. 6. Op • 1) client -> server request(PUT, GET) using RDMA WRITE • 2) server polls per-client memory region to check request • 3) Do key-value lookup • 4) server -> client reply using SEND Thursday, August 7, 14
  7. 7. Evaluation • Apt • IB FDR(56 Gbps) ConnectX-3 • Susitna • RoCE(40GbE CX-3 MX313A) Thursday, August 7, 14
  8. 8. Thursday, August 7, 14
  9. 9. Thursday, August 7, 14
  10. 10. Thursday, August 7, 14
  11. 11. Thursday, August 7, 14
  12. 12. References • [1] https://www.cs.cmu.edu/~akalia/doc/ herd_readable.pdf • https://github.com/efficient/HERD Thursday, August 7, 14

×