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
NVMKV: a scalable and lightweight flash aware key-value store
Leonardo Marmol,Swaminathan Sundararaman,Nisha Talagala,Raju Rangaswami,Sushma Devendrappa,Bharath Ramsundar,Sriram Ganesan +6 more
TL;DR: NVMKV is a scalable and lightweight KV store that leverages advanced capabilities that are becoming available in modern FTLs and outperforms state of the art KV stores by 50%-300%, and significantly improves performance predictability for the YCSB KV benchmark when compared with the popular LevelDB KV Store.
Proceedings Article
TierStore: a distributed filesystem for challenged networks in developing regions
TL;DR: It is shown how these properties enable easy adaptation and robust deployment of applications even in highly intermittent networks and demonstrate the flexibility and bandwidth savings of the prototype with initial evaluation results.
Journal ArticleDOI
Scheduling highly available applications on cloud environments
TL;DR: This paper proposes to build highly available applications, i.e.,?systems with low downtimes, by taking advantage of the component based architecture and of the application scaling property, and presents two algorithms for ensuring web applications' high availability in cloud systems.
Proceedings ArticleDOI
Achieving 100,000,000 database inserts per second using Accumulo and D4M
Jeremy Kepner,William Arcand,David Bestor,Bill Bergeron,Chansup Byun,Vijay Gadepally,Matthew Hubbell,Peter Michaleas,Julie Mullen,Andrew Prout,Albert Reuther,Antonio Rosa,Charles Yee +12 more
TL;DR: The Apache Accumulo database as discussed by the authors is an open source relaxed consistency database that is widely used for government applications and is designed to deliver high performance on unstructured data such as graphs of network data.
Journal ArticleDOI
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
TL;DR: This article presents Monkey, an LSM-tree based key-value store that strikes the optimal balance between the costs of updates and lookups with any given main memory budget, and maps the design space onto a closed-form model that enables adapting the merging frequency and memory allocation to strike the best tradeoff among lookup cost, update cost and main memory.
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.