Abstract | ||
---|---|---|
Highly available database systems rely on data replication to tolerate machine failures. Both classes of existing replication algorithms, active-passive and active-active, were designed in a time when network was the dominant performance bottleneck. In essence, these techniques aim to minimize network communication between replicas at the cost of incurring more processing redundancy; a trade-off that suitably fitted the conventional wisdom of distributed database design. However, the emergence of next-generation networks with high throughput and low latency calls for revisiting these assumptions.
In this paper, we first make the case that in modern RDMA-enabled networks, the bottleneck has shifted to CPUs, and therefore the existing network-optimized replication techniques are no longer optimal. We present Active-Memory Replication, a new high availability scheme that efficiently leverages RDMA to completely eliminate the processing redundancy in replication. Using Active-Memory, all replicas dedicate their processing power to executing new transactions, as opposed to performing redundant computation. Active-Memory maintains high availability and correctness in the presence of failures through an efficient RDMA-based undo-logging scheme. Our evaluation against active-passive and active-active schemes shows that Active-Memory is up to a factor of 2 faster than the second-best protocol on RDMA-based networks.
|
Year | DOI | Venue |
---|---|---|
2019 | 10.14778/3342263.3342639 | PVLDB |
Field | DocType | Volume |
Computer science,Remote direct memory access,High availability,Database | Journal | 12 |
Issue | ISSN | Citations |
11 | 2150-8097 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Erfan Zamanian | 1 | 54 | 5.01 |
Xiangyao Yu | 2 | 270 | 16.17 |
Michael Stonebraker | 3 | 12463 | 4310.17 |
Tim Kraska | 4 | 2226 | 133.57 |