Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and never fails. This requires the transactional subsystem to provide opacity (strict serializability for both committed and aborted transactions), as well as transparent fault tolerance with high availability. As even the best abstractions are unlikely to be used if they perform poorly, the system must also provide high performance. Existing distributed transactional designs either weaken this abstraction or are not designed for the best performance within a data center. This paper extends the design of FaRM - which provides strict serializability only for committed transactions - to provide opacity while maintaining FaRM's high throughput, low latency, and high availability within a modern data center. It uses timestamp ordering based on real time with clocks synchronized to within tens of microseconds across a cluster, and a failover protocol to ensure correctness across clock master failures. FaRM with opacity can commit 5.4 million neworder transactions per second when running the TPC-C transaction mix on 90 machines with 3-way replication.

中文翻译：

---

使用全球时间的具有不透明度的快速通用分布式事务

事务可以通过对应用程序开发人员隐藏数据分布、并发性和故障来简化分布式应用程序。理想情况下，开发人员会看到单个大型机器的抽象，该机器按顺序运行事务并且永不失败。这需要事务子系统提供不透明性（对提交和中止的事务都具有严格的序列化能力），以及具有高可用性的透明容错。如果性能不佳，即使是最好的抽象也不太可能使用，因此系统还必须提供高性能。现有的分布式事务设计要么削弱了这种抽象，要么不是为了在数据中心内获得最佳性能而设计的。本文扩展了 FaRM 的设计——它只为提交的事务提供严格的可串行化——以提供不透明性，同时在现代数据中心内保持 FaRM 的高吞吐量、低延迟和高可用性。它使用基于实时的时间戳排序，时钟在集群中同步在几十微秒内，并使用故障转移协议来确保时钟主机故障的正确性。当在具有 3 路复制的 90 台机器上运行 TPC-C 事务组合时，具有不透明度的 FaRM 每秒可以提交 540 万个新订单事务。和故障转移协议，以确保时钟主机故障的正确性。当在具有 3 路复制的 90 台机器上运行 TPC-C 事务组合时，具有不透明度的 FaRM 每秒可以提交 540 万个新订单事务。和故障转移协议，以确保时钟主机故障的正确性。当在具有 3 路复制的 90 台机器上运行 TPC-C 事务组合时，具有不透明度的 FaRM 每秒可以提交 540 万个新订单事务。