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
Journal ArticleDOI
Highly reliable architecture using the 80/20 rule in cloud computing datacenters
TL;DR: This paper presents a highly reliable cloud architecture by leveraging the 80/20 rule (80% of cluster failures come from 20% of physical machines) to identify failure-prone physical machines by dividing each cluster into reliable and risky sub-clusters.
Proceedings ArticleDOI
Warranties for faster strong consistency
TL;DR: Experiments with some non-trivial programs demonstrate that warranties enable high performance despite the simple programming model, and improve scalability and system throughput.
Proceedings ArticleDOI
Practical application and evaluation of no-SQL databases in Cloud Computing
TL;DR: This project develops an application which follows a keyword over multiple social media platforms, maintaining the aggregated data in a no-SQL database, and analyzes the no_SQL database systems, defining their architecture and data model and depending on the needs, choose the appropriate one.
Proceedings ArticleDOI
CADRE: Carbon-Aware Data Replication for Geo-Diverse Services
TL;DR: CADRE uses the multiple-choice secretary algorithm to replicate objects with large footprints to low emission sites and models carbon footprints for each object using the footprint-replication curve, a graph that maps replication factors to expected carbon footprints.
Journal ArticleDOI
The state of peer-to-peer network simulators
TL;DR: The landscape of simulators for research in peer-to-peer (P2P) networks is looked at by conducting a survey of a combined total of over 280 papers from before and after 2007, and a set of criteria that P2P simulators should meet are proposed.
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.