Eventually consistent

被引:9
作者
Vogels, Werner [1 ]
机构
[1] Amazon.com, United States
来源
Queue | 2008年 / 6卷 / 06期
关键词
Large scale systems;
D O I
10.1145/1466443.1466448
中图分类号
学科分类号
摘要
Data inconsistency in large-scale reliable distributed systems has to be tolerated for two reasons: improving read and write performance under highly concurrent conditions; and handling partition cases where a majority model would render part of the system unavailable even though the nodes are up and running. Whether or not inconsistencies are acceptable depends on the client application. In all cases the developer needs to be aware that consistency guarantees are provided by the storage systems and need to be taken into account when developing applications. There are a number of practical improvements to the eventual consistency model, such as session-level consistency and monotonie reads, which provide better tools for the developer. Many times the application is capable of handling the eventual consistency guarantees of the storage system without any problem. A specific popular case is a Web site in which we can have the notion of user-perceived consistency. In this scenario the inconsistency window needs to be smaller than the time expected for the customer to return for the next page load. This allows for updates to propagate through the system before the next read is expected. The goal of this article is to raise awareness about the complexity of engineering systems that need to operate at a global scale and that require careful tuning to ensure that they can deliver the durability, availability, and performance that their applications require. One of the tools the system designer has is the length of the consistency window, during which the clients of the systems are possibly exposed to the realities of large-scale systems engineering. © 2008 ACM.
引用
收藏
页码:14 / 19
页数:5
相关论文
共 4 条
[1]  
Brewer E.A., Towards robust distributed systems, Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, (2000)
[2]  
ACM Queue, 2, 8, pp. 22-33, (2004)
[3]  
DeCandia G., Hastorun D., Jampani M., Kakulapati G., Lakshman A., Pilchin A., Sivasubramanian S., Vosshall P., Vogels W., Dynamo: Amazon's highly available key-value store, Proceedings of the 21st ACM Symposium on Operating Systems Principles, (2007)
[4]  
Gilbert S., Lynch N., Brewer's conjecture and the feasibility of consistent, available, partition-tolerant Web services, ACMSIGACTNews, 33, 2, (2002)