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
Distributed data placement to minimize communication costs via graph partitioning
TL;DR: This work reduces the data placement problem to the well-studied problem of Graph Partitioning, which is NP-Hard but for which efficient approximation algorithms exist, and produces nearly-optimal solutions in seconds.
Patent
System and method for maintaining a master replica for reads and writes in a data store
TL;DR: In this article, the authors describe a system that implements a data storage service on behalf of clients in multiple replicas on respective computing nodes, where the system may employ an external service to select a master replica for a replica group.
Proceedings ArticleDOI
Smart: a MapReduce-like framework for in-situ scientific analytics
TL;DR: A novel MapReduce-like framework that supports efficient in-situ scientific analytics, and is designed so that analytics can be launched from the parallel code region of a simulation program.
Proceedings ArticleDOI
Blazes: Coordination analysis for distributed programs
TL;DR: BLAZES is a cross-platform program analysis framework that identifies program locations that require coordination to ensure consistent executions, and automatically synthesizes application-specific coordination code that can significantly outperform general-purpose techniques.
Proceedings ArticleDOI
Design Principles for Scaling Multi-core OLTP Under High Contention
TL;DR: This paper implements a prototype system, Orthrus, that is motivated by the principles of separation of database component functionality and advanced planning of transactions, and finds that these two principles alone result in significantly improved scalability on high-contention workloads, and an order of magnitude increase in throughput for a non-trivial subset of these contended workloads.
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.