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
Elfen scheduling: fine-grain principled borrowing from latency-critical workloads using simultaneous multithreading
TL;DR: This work introduces principled borrowing to control SMT hardware execution in which batch threads borrow core resources, and introduces the nanonap system call to stop the batch thread's execution without yielding its lane to the OS scheduler, ensuring that requests have exclusive use of the core's resources.
Posted Content
POPE: Partial Order-Preserving Encoding.
TL;DR: Partial order preserving encoding (POPE) as discussed by the authors was proposed to enable efficient range queries over encrypted data while preserving the relative order of the underlying plaintexts, thus allowing range and comparison queries to be performed directly over the ciphertext.
Cloud Databases: A Paradigm Shift in Databases
Indu Arora,Anu Gupta +1 more
TL;DR: The state of the art in the cloud databases and various architectures is reviewed, the challenges to develop cloud databases that meet the user requirements are assessed and popularly used Cloud databases such as Big Table, Sherpa and SimpleDB are discussed.
Patent
Systems and methods for implementing an enterprise-class converged compute-network-storage appliance
Sandip Agarwala,Abhishek Chaturvedi,Shravan Gaonkar,Mallikarjunan Mahalingam,Sazzala Reddy,Smit Shah,Faraz Shaikh,Praveen Vegulla,Krishna Yadappanavar,Jeffrey A. Zabarsky +9 more
TL;DR: In this article, a distributed storage system that dispatches an input/output request is described, where the storage controller client computes a target virtual node and determines a target physical node that corresponds to the target virtual nodes, where each of the physical nodes is hosted on a plurality of storage controller servers.
WikiBench: A distributed, Wikipedia based web application benchmark
TL;DR: The design and implementation of WikiBench, a distributed web application benchmarking tool based on Wikipedia, is presented, able to create realistic workloads with thousands of requests per second to any system hosting the freely available Wikipedia data and software.
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.