Distributed, fault-tolerant in-place consensus sequence on innovative hardware as building block for data management.

像Paxos算法这样的Quorum Consensus算法被广泛用作分布式系统中容错的基本构建块。不幸的是，分布式法定人数共识会导致笨蛋进行协商并安全地存储共识。因此，我们计划从三个方面优化基于Paxos的一致性序列的容错：1.利用多播和减少现代互连的操作来减少延迟和消息数量；2.使用远程直接存储器访问(RDMA)和NVRAM相结合来管理分布式共享状态；3.修改Paxos以支持就地一致性决策序列，并避免为每个Paxos实例单独分配内存资源。然后，我们在一致性序列之上构建高效的定制数据类型，支持部分更新、多读单写器锁或比较并交换语义。由此产生的分布式容错一致性将提供低延迟和高吞吐量的决策。它将允许在以前由于其高延迟而避免的新场景中应用可恢复的分布式共识。优化的共识可以用作当前和未来分布式数据管理和数据库系统(包括在SPP中开发的那些)的构建块，这些系统通常依赖于一系列决策来处理锁、事务、进行原子更改(如比较和交换)、支持复制状态机，或选举下一主服务器等。

Quorum consensus algorithms like the Paxos algorithm are widely usedas basic building blocks for fault-tolerance in distributedsystems. Unfortunately, distributed quorum consensus causes muchoverhead to negotiate and safely store the consensus. We thereforeplan to optimize Paxos-based fault-tolerance for sequences ofconsensus in three ways:1. exploit multicast and reduce operations of modern interconnects to reduce the latency and number of messages,2. use remote direct memory access (RDMA) in combination with NVRAM to manage a distributed shared state,3. modify Paxos to support a sequence of consensus decisions in-place and avoid separate memory resources for each Paxos instance.4. We then build efficient custom datatypes on top of consensus sequences, that support partial updates, multiple-reader-single-writer locks, or compare-and-swap semantics.The resulting distributed fault-tolerant consensus will provide lowlatency and high-throughput decisions. It will allow to applyrecoverable distributed consensus in new scenarios where it wasavoided before due to its high latency. The optimized consensus canbe used as a building block in current and future distributed datamanagement and database systems - including those developed in SPP - that often rely on a sequence of decisions to process locks,transactions, to make atomic changes like compare and swap, to supportreplicated state machines, or to elect the next master etc.