Proceedings ArticleDOI
Dynamo: amazon's highly available key-value store
Giuseppe deCandia,Deniz Hastorun,Madan Mohan Rao Jampani,Gunavardhan Kakulapati,Avinash Lakshman,Alex Pilchin,Swaminathan Sivasubramanian,Peter Sven Vosshall,Werner Vogels +8 more
- Vol. 41, Iss: 6, pp 205-220
TLDR
D Dynamo is presented, a highly available key-value storage system that some of Amazon's core services use to provide an "always-on" experience and makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.Abstract:
Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives the reliability and scalability of the software systems.This paper presents the design and implementation of Dynamo, a highly available key-value storage system that some of Amazon's core services use to provide an "always-on" experience. To achieve this level of availability, Dynamo sacrifices consistency under certain failure scenarios. It makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.read more
Citations
More filters
Proceedings Article
Census: location-aware membership management for large-scale distributed systems
TL;DR: It is believed that Census is the first system to provide a consistent membership abstraction at very large scale, greatly simplifying the design of applications built atop large deployments such as multi-site data centers.
Proceedings Article
CloudViews: communal data sharing in public clouds
TL;DR: It is argued that co-location creates an auspicious environment for Web service composition, which in turn spawns immense opportunities for simplifying Web service construction, as well as identifying untapped opportunities in the new shared-cloud world.
Proceedings ArticleDOI
Improving Cloud Service Resilience Using Brownout-Aware Load-Balancing
Cristian Klein,Alessandro Vittorio Papadopoulos,Manfred Dellkrantz,Jonas Dürango,Martina Maggio,Karl-Erik Årzén,Francisco Hernandez-Rodriguez,Erik Elmroth +7 more
TL;DR: Experimental evaluation shows that the approach enables cloud services to remain responsive despite cascading failures, and when compared to Shortest Queue First (SQF), believed to be near-optimal in the non-adaptive case, the algorithms improve user experience by 5%, with high statistical significance, while preserving response time predictability.
Proceedings ArticleDOI
Synapse: a microservices architecture for heterogeneous-database web applications
TL;DR: This work presents Synapse, an easy-to-use, strong-semantic system for large-scale, data-driven Web service integration, developed on top of the popular Web framework Ruby-on-Rails, which supports data replication among a wide variety of SQL and NoSQL databases.
Proceedings ArticleDOI
Minimizing Commit Latency of Transactions in Geo-Replicated Data Stores
TL;DR: A lower-bound on commit latency is derived to develop a commit protocol, called Helios, that achieves low commit latencies and in a real-world deployment on five datacenters, Helios has a commit latency that is close to the optimal.
References
More filters
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Book ChapterDOI
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
The Google file system
TL;DR: This paper presents file system interface extensions designed to support distributed applications, discusses many aspects of the design, and reports measurements from both micro-benchmarks and real world use.