Meerkat: Multicore-Scalable Replicated Transactions Following the Zero Coordination Principle
1
Meerkat: Multicore-Scalable Replicated Transactions Following the - - PowerPoint PPT Presentation
Meerkat: Multicore-Scalable Replicated Transactions Following the Zero Coordination Principle 1 Distributed storage systems are getting faster Peak throughput (million txns/s) Can we achieve this? 10 in-memory, kernel-bypass 8 6 4
1
2
# cores Peak throughput (million txns/s) 40 2 4 6 8 10 critical section
disk-based, in-kernel networking in-memory, kernel-bypass in-memory, in-kernel networking Can we achieve this?
3
4
agreement on log order contention on the log centralized timestamp management contention on the list of active/validated transactions Replication Concurrency control
5
decentralized agreement
per-core record of transactions clients pick the commit timestamp key-parallel OCC
agreement on log order contention on the log centralized timestamp management contention on the list of active/validated transactions Replication Concurrency control
6
7
synchronized clocks
Correctness comes from quorum intersection + pairwise conflict checks; see paper
(fast path)
(slow path)
8
decentralized agreement
per-core record of transactions clients pick the commit timestamp key-parallel OCC
agreement on log order contention on the log centralized timestamp management contention on the list of active/validated transactions Replication Concurrency control
ZCP ✓ ZCP ✓
9
(in the absence of conflicts and failures)
10
No cross-processor coordination No cross-replica coordination X X X ✓ ✓ X ✓ ✓
11
short txns (YCSB-T), 1 mil keys/core
Log contention Contention on the validation list Leader bottleneck
12
short txns (YCSB-T), 1 mil keys/core, 64 hyperthreads
Expensive aborts More slow paths