Gryff: Unifying Consensus and Shared Registers
summary
Gryff implements a geo-replicated linearizable store that combines a multi-writer ABD register protocol for reads/writes with an EPaxos-based RMW path and a new ordering called carstamps. Carstamps are tuples (TS, coordinator ID, rmwC) that force each RMW’s stamp to be exactly one greater than its base, letting most reads complete in one wide-area round trip across three emulated regions. Implementation and NSDI ’20 evaluation show Gryff cuts read tail latency roughly twofold versus MultiPaxos/EPaxos.
AI-written summary · about
chapters (9)
- 0:00Storage system challenges
- 1:38Consensus vs shared registers
- 2:53The role of consensus
- 4:42Shared register limitations
- 6:29Introducing Car stamps
- 8:47Car stamp mechanism
- 10:27Gryff architecture
- 13:27Performance evaluation
- 16:48Conclusion and Q&A
related talks
19mPineapple: Unifying Multi-Paxos and Atomic Shared Registers
16mSwiftPaxos: Fast Geo-Replicated State Machines
19mBuilding a Performant Configuration-Store Layer
42mBeyond Blockchain: Convergent Consensus
16mDRust: Language-Guided Distributed Shared Memory with Fine Granularity, Full...
22mLiberating Distributed Consensus
40mImplementing Distributed Consensus
01h 04mConsensus with Asymmetric Trust