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 ArticleDOI
Exploiting Node Connection Regularity for DHT Replication
TL;DR: This paper proposes an alternative replication strategy that leverages nodes that exhibit regularity in their connection pattern and shows that this regularity-based replication strategy induces a systematically lower network usage than existing state of the art replication strategies.
Proceedings ArticleDOI
Placement in Clouds for Application-Level Latency Requirements
TL;DR: This paper presents placement algorithms that exploit the Euclidean triangular inequality property of network topologies, and shows that Message Sequence Charts (MSCs), a widely-used mechanism for describing the execution of application procedures, can be naturally translated into the formalism of collective latency expressions.
Journal ArticleDOI
PNUTS in Flight: Web-Scale Data Serving at Yahoo
Adam Silberstein,Jianjun Chen,David Lomax,B. McMillan,Masood Mortazavi,P. P. S. Narayan,Raghu Ramakrishnan,Russell Sears +7 more
TL;DR: The authors review PNUTS' growing adoption, point to specific applications, and detail several of PN UTS' features.
Proceedings ArticleDOI
An Exploration of Serverless Architectures for Information Retrieval
Matt Crane,Jimmy Lin +1 more
TL;DR: This paper explores a novel application of serverless architectures to information retrieval and describes a search engine built in this manner with Amazon Web Services: postings lists are stored in the DynamoDB NoSQL store and the postings traversal algorithm for query evaluation is implemented in the Lambda service.
Journal ArticleDOI
Fast Distributed Transactions and Strongly Consistent Replication for OLTP Database Systems
TL;DR: Calvin is a practical transaction scheduling and data replication layer that uses a deterministic ordering guarantee to significantly reduce the normally prohibitive contention costs associated with distributed transactions, allowing near-linear scalability on a cluster of commodity machines.
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.