弱一致性的代数律(扩展版)
Algebraic Laws for Weak Consistency (Extended Version)
摘要:
现代分布式系统通常依赖于所谓的弱一致性数据库,其通过牺牲分布式事务处理的一致性保证来实现可伸缩性。这样的数据库已经正式在两种不同的风格,一个基于抽象的执行和其他依赖图的基础上。这些风格之间的选择已根据预期的应用程序:前者已被用来指定和验证这些数据库的实现,后者证明在数据库上运行的程序的属性。在本文中,我们提出了一套新的代数法(即不等式),连接这两种风格的规范,法律关系的二进制关系中使用的规范的基础上抽象的执行,那些使用的规范的基础上依赖图。然后,我们表明,这种代数连接产生所谓的鲁棒性标准,条件,确保程序运行在一个弱一致的数据库上不会表现出异常行为,由于这种弱一致性。这些标准使得对运行在这些数据库之上的程序进行推理变得容易,并且可以成为动态或静态程序分析的基础。对于某一类一致性模型规范,我们证明了一个完整的抽象结果,连接这两种风格的规范。
英文摘要:
Modern distributed systems often rely on so called weakly-consistent databases, which achieve scalability by sacrificing the consistency guarantee of distributed transaction processing. Such databases have been formalised in two different styles, one based on abstract executions and the other based on dependency graphs. The choice between these styles has been made according to intended applications: the former has been used to specify and verify the implementation of these databases, and the latter to prove properties of programs running on top of the databases. In this paper, we present a set of novel algebraic laws (i.e. inequations) that connect these two styles of specifications; the laws relate binary relations used in a specification based on abstract executions, to those used in a specification based on dependency graphs. We then show that this algebraic connection gives rise to so called robustness criteria, conditions which ensures that a program running on top of a weakly-consistent database does not exhibit anomalous behaviours due to this weak consistency. These criteria make it easy to reason about programs running on top of these databases, and may become a basis for dynamic or static program analyses. For a certain class of consistency models specifications, we prove a full abstraction result that connects the two styles of specifications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。