CSR: Small: Scalable Transactional Replication: Theory, Protocols, and Middleware Systems

CSR：小型：可扩展事务复制：理论、协议和中间件系统

• 批准号: 1523558
• 负责人: Binoy Ravindran
• 金额: $ 45万
• 依托单位: Virginia Polytechnic Institute and State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-10-01 至 2019-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1523558&HistoricalAwards=false
• 关键词: CSR; Small; Scalable; Transactional; Replication

With the exponentially increasing popularity of web-based networked applications, their back-end IT systems must process an ever growing volume of data and service requests. Obtaining high scalability is challenging when application workloads generate concurrent accesses on shared data that is replicated to ensure data survival and service availability in the presence of failures. The classical transactional technology for solving this problem -- State Machine Replication -- does not scale: regulating the commits of distributed transactions requires solving consensus, whose leader is a significant scalability bottleneck. Leaderless consensus protocols unfruitfully pay the cost of large quorums for providing fast decisions only whenever possible. To overcome these limitations, the project is developing two complimentary techniques for building scalable consensus protocols for transactional systems. In the first technique, called the Caesar approach, consensus decisions are always made in two communication delays, i.e., fast decisions, using a scheme based on proposed positions: a transaction activated on a node, i.e., the transaction's coordinator, is executed on all nodes at a position proposed by the transaction's coordinator, and after the execution of any other conflicting transaction that was chosen at a lesser position. To achieve that, the transaction's coordinator only needs to know that the proposed position is not rejected by a fast quorum of nodes. However, by exploiting network delays and clock drift estimates, the positions are adjusted in a way such that they are never rejected. Thus, the cost of using fast quorums larger than the ones necessary to solve consensus in order to exploit a fast decision is amortized by the ability of always deciding in that way. In the second technique, called the M^2Paxos approach, the order of transactions is generally decided in only two communication delays by relying on the classical quorum size that is strictly necessary to solve consensus, i.e., a majority of nodes. This is achieved by exploiting application's data access locality. In particular, in case of low contention, M^2Paxos inspects the data to be accessed by a submitted transaction and determines the node responsible for ordering the transaction. This allows all transactions accessing the same data to be implicitly ordered by the same node.The project is transitioning Caesar and M^2Paxos into the experimental, open-source HyFlow transactional middleware system, which enables adoption of the techniques by the research community at large. Additionally, the project is transitioning the techniques into Red Hat/JBoss's production transactional middleware, Infinispan, which enables adoption of the techniques by J2EE developers at large.

随着基于Web的网络应用的日益流行，它们的后端IT系统必须处理不断增长的数据量和服务请求。当应用程序工作负载生成对共享数据的并发访问时，获得高可伸缩性是一项挑战，这些共享数据被复制以确保在出现故障时的数据生存和服务可用性。解决此问题的经典事务技术--状态机复制--不具有伸缩性：规范分布式事务的提交需要解决共识，而共识是一个重要的可伸缩性瓶颈。无领导的共识协议只在可能的情况下才提供快速决定，却徒劳无功地付出了大量法定人数的代价。为了克服这些限制，该项目正在开发两种互补的技术，用于为事务系统构建可伸缩的共识协议。在称为Caesar方法的第一种技术中，使用基于建议位置的方案，总是在两个通信延迟中做出一致决定，即快速决定：在节点上激活的事务，即事务的协调器，在事务协调器建议的位置处的所有节点上执行，并且在较小位置处选择的任何其他冲突事务执行之后。要实现这一点，事务的协调器只需要知道建议的位置不会被快速仲裁的节点拒绝。然而，通过利用网络延迟和时钟漂移估计，位置以一种永远不会被拒绝的方式进行调整。因此，使用比解决共识所需的法定人数更高的快速法定人数来利用快速决策的成本，是由总是以这种方式做出决定的能力摊销的。在第二种技术中，称为M^2Paxos方法，事务的顺序通常仅在两个通信延迟内通过依赖于解决共识所必需的经典仲裁大小来确定，即大多数节点。这是通过利用应用程序的数据访问局部性实现的。特别是，在低争用的情况下，M^2Paxos检查提交的事务要访问的数据，并确定负责对该事务排序的节点。这允许访问相同数据的所有事务由相同节点隐式排序。该项目正在将Caesar和M^2Paxos过渡到实验性的开源HyFlow事务中间件系统，这使得研究社区能够广泛采用这些技术。此外，该项目正在将这些技术过渡到Red Hat/JBoss的生产事务中间件Infinispan.它使广大的J2EE开发人员能够采用这些技术。