Pragh: Locality-preserving Graph Traversal with Split Live Migration
Talkat USENIX ATC '19 · on Thursday, 2019-07-11· at 16:35· USENIX ATC Track II: Grand Ballroom VII–IX·
summary
Pragh implements split live migration that moves values only while leaving keys in place, enabling fine-grained, zero-metadata reconfiguration over RDMA. It integrates an RDMA-friendly location cache (from DrTM-KV) and a check-and-forward update protocol to keep evolving graphs consistent. On an 8-node RDMA cluster Pragh eliminates 97% of remote value accesses, boosts throughput up to 19×, cuts median latency up to 94%, and a Wukong port shows up to 2.53× throughput improvement.
AI-written summary · about
chapters (8)
- 0:00Start
- 2:49Traditional: Shard-based Migration Not Fits Graph
- 4:06Shard-based Migration: Dilemma
- 7:13System Architecture
- 7:57Unilateral Migration Protocol
- 9:26Towards Fully-localized Migration
- 10:24Integration with Location Cache
- 10:49Separate Monitoring: Lightweight Monitor
related talks
25mDisaggregating Persistent Memory and Controlling Them Remotely
24mPLOVER: Fast, Multi-core Scalable Virtual Machine Fault-tolerance
15mReplicating Persistent Memory Key-Value Stores with Efficient RDMA Abstraction
18mIn-Memory Key-Value Store Live Migration with NetMigrate
23mTeRM: Extending RDMA-Attached Memory with SSD
12mCharacterizing and Optimizing Remote Persistent Memory with RDMA and NVM
45mBuilding Available and Partition Tolerant...
14mLoLKV: The Logless, Linearizable, RDMA-based Key-Value Storage System