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
Pipelined Compaction for the LSM-Tree
TL;DR: This paper analyzes the compaction procedure, recognizes the performance bottleneck, and proposes the Pipelined Compaction Procedure (PCP) to better utilize the parallelism of CPUs and I/O devices and proves that PCP can improve the compACTION bandwidth.
Journal ArticleDOI
Paradigms for Realizing Machine Learning Algorithms
TL;DR: The essence of the article is that for a number of machine learning algorithms, it is important to look beyond the Hadoop's Map-Reduce paradigm in order to make them work on big data.
Proceedings ArticleDOI
Caching memcached at reconfigurable network interface
Eric Shun Fukuda,Hiroaki Inoue,Takashi Takenaka,Dahoo Kim,Tsunaki Sadahisa,Tetsuya Asai,Masato Motomura +6 more
TL;DR: This approach augments the software memcached running on the host CPU by caching its data and some operations at the FPGA-equipped network interface card (NIC) mounted on the server, and estimates that the latency improved by an order of magnitude over softwarememcachedrunning on a high performance CPU.
Journal ArticleDOI
Managing big RDF data in clouds: Challenges, opportunities, and solutions
Nahla Mohammed Elzein,Mazlina Abdul Majid,Ibrahim Abaker Targio Hashem,Ibrar Yaqoob,Fadele Ayotunde Alaba,Muhammad Imran +5 more
TL;DR: The basic principles of RDF data management are highlighted, which allow researchers to know the most recent stage in developing RDF graphs and its achievement, and comparative studies among current storage systems and query processing approaches in understanding their efficiency are provided.
Proceedings ArticleDOI
Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
TL;DR: Wren is presented, the first TCC system that i) implements nonblocking read operations, thereby achieving low latency, and ii) allows an application to efficiently scale out within a replication site by sharding.
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.