Eventual Consistency Today: Limitations, Extensions, and Beyond

被引：86

作者：

Bailis, Peter ^{[1
,2
]}

Ghodsi, Ali ^{[3
]}

机构：

[1] Univ Calif Berkeley, AMPLab Project, Berkeley, CA 94720 USA

[2] Univ Calif Berkeley, BOOM Project, Berkeley, CA USA

[3] KTH Royal Inst Technol, Stockholm, Sweden

来源：

COMMUNICATIONS OF THE ACM | 2013年 / 56卷 / 05期

关键词：

Distributed computer systems - Distributed database systems;

D O I：

10.1145/2447976.2447992

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Brewer's conjecture'based on his experiences building infrastructure for some of the first Internet search engines at Inktomi'states that distributed systems requiring always on, highly available operation cannot guarantee the illusion of coherent, consistent single-system operation in the presence of network partitions, which cut communication between active servers. Moreover, even without partitions, a system that chooses availability over consistency enjoys benefits of low latency. If a server can safely respond to a user's request when it is partitioned from all other servers, then it can also respond to a user's request without contacting other servers even when it is able to do so. Eventual consistency as an available alternative. Given the CAP impossibility result, distributed-database designers sought weaker consistency models that would enable both availability and high performance.

引用

页码：55 / 63

页数：9