FAWN: a fast array of wimpy nodes

@article{Andersen2011FAWNAF,
  title={FAWN: a fast array of wimpy nodes},
  author={David G. Andersen and Jason Franklin and Michael Kaminsky and Amar Phanishayee and Lawrence Tan and Vijay Vasudevan},
  journal={Commun. ACM},
  year={2011},
  volume={54},
  pages={101-109}
}
This paper presents a fast array of wimpy nodes---FAWN---an approach for achieving low-power data-intensive data-center computing. FAWN couples low-power processors to small amounts of local flash storage, balancing computation and I/O capabilities. FAWN optimizes for per node energy efficiency to enable efficient, massively parallel access to data. The key contributions of this paper are the principles of the FAWN approach and the design and implementation of FAWN-KV---a consistent, replicated… 

Figures and Tables from this paper

FAWN: a fast array of wimpy nodes
TLDR
The key contributions of this paper are the principles of the FAWN architecture and the design and implementation of FAWN-KV--a consistent, replicated, highly available, and high-performance key-value storage system built on a FAWN prototype.
PowerCass: Energy Efficient, Consistent Hashing Based Storage for Micro Clouds Based Infrastructure
TLDR
This work presents an energy conserving implementation of a consistent hashing based key-value store, called PowerCass, based on Apache's Cassandra, which is able to reduce the energy consumption by up to 66% compared to the unmodified key- value store Cassandra.
dyn-PowerCass: Energy efficient distributed store based on dynamic data placement strategy
TLDR
The paper addressed the challenge of improving performance through dynamic data relocation while preserving energy efficiency and the fast zero-hop (constant time routing) data lookup attained through consistent hashing in PowerCass.
From paxos to CORFU: a flash-speed shared log
TLDR
The key idea in CORFU is to expose a cluster of network-attached flash devices as a single, shared log to clients running within the data center.
The search for energy-efficient building blocks for the data center
TLDR
This paper conducts a survey of several small clusters of machines in search of the most energy-efficient data center building block targeting data-intensive computing, and builds five-node homogeneous clusters of each type and runs Dryad, a distributed execution engine, with a collection of data- intensive workloads to measure the energy consumption per task.
Characterizing Performance and Energy-Efficiency of the RAMCloud Storage System
TLDR
It is revealed that although RAMCloud is scalable for read-only applications, it exhibits non-proportional power consumption and the current replication scheme implemented in RAMCloud limits the performance and results in high energy consumption.
FlashStore: High Throughput Persistent Key-Value Store
TLDR
This work uses real-world data traces from two data center applications, namely, Xbox LIVE Primetime online multi-player game and inline storage deduplication, to drive and evaluate the design of FlashStore on traditional and low power server platforms.
HyperDex : A Distributed , Searchable Key-Value Store for Cloud Computing
TLDR
The key insight behind HyperDex is the concept of hyperspace hashing in which objects with multiple attributes are mapped into a multidimensional hyperspace, which leads to efficient implementations not only for retrieval by primary key, but also for partially-specified secondary attribute searches and range queries.
Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection
TLDR
Harmonia is a replicated storage architecture that exploits the capability of new-generation programmable switches to obviate this tradeoff by providing near-linear scalability without sacrificing consistency, and improves the throughput of a variety of replication protocols.
Load Balancing of Heterogeneous Workloads in Memcached Clusters
TLDR
An automated load balancer that can perform line-rate request redirection in a far more dynamic manner is proposed and how stream analytic techniques can be used to efficiently detect key hotspots are described.
...
1
2
3
...

References

SHOWING 1-10 OF 16 REFERENCES
FAWN: a fast array of wimpy nodes
TLDR
The key contributions of this paper are the principles of the FAWN architecture and the design and implementation of FAWN-KV--a consistent, replicated, highly available, and high-performance key-value storage system built on a FAWN prototype.
Gordon: using flash memory to build fast, power-efficient clusters for data-intensive applications
TLDR
The paper presents an exhaustive analysis of the design space of Gordon systems, focusing on the trade-offs between power, energy, and performance that Gordon must make, and describes a novel flash translation layer tailored to data intensive workloads and large flash storage arrays.
FlashDB: Dynamic Self-tuning Database for NAND Flash
  • S. Nath, A. Kansal
  • Computer Science
    2007 6th International Symposium on Information Processing in Sensor Networks
  • 2007
TLDR
This work formalizes the self-tuning nature of an index as a two-state task system and proposes a 3-competitive online algorithm that achieves the theoretical optimum, and prototype and compare different indexing schemes on multiple flash devices and workloads, and shows that the indexing scheme outperforms existing schemes under all workloads and flash devices the authors consider.
Low-power amdahl-balanced blades for data intensive computing
TLDR
This paper proposes an alternative architecture comprising large number of so-called Amdahl blades that combine energy-efficient CPUs with solid state disks to increase sequential read I/O throughput by an order of magnitude while keeping power consumption constant.
Online maintenance of very large random samples on flash storage
TLDR
A key finding of this study is that "semi-random" writes (as defined in the paper) on flash cards are over two orders of magnitude faster and more energy-efficient than random writes.
Chord: A scalable peer-to-peer lookup service for internet applications
TLDR
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.
Dynamo: amazon's highly available key-value store
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.
Enabling Enterprise Solid State Disks Performance
TLDR
This paper examines two modern enterprise Flash-based solid state devices and considers the effects of specific operating system storage software on top of the devices, the role of parallelism, and the consequences of sustained random write access on device performance.
Delivering Energy Proportionality with Non Energy-Proportional Systems - Optimizing the Ensemble
TLDR
This paper demonstrates how optimization-based techniques can be used to build systems with off-the-shelf hardware that, when viewed at the aggregate level, approximate the behavior of energy-proportional systems.
Understanding and Designing New Server Architectures for Emerging Warehouse-Computing Environments
TLDR
A new solution that incorporates volume non-server-class components in novel packaging solutions, with memory sharing and flash-based disk caching, has promise, with a 2X improvement on average in performance-per-dollar for the benchmark suite.
...
1
2
...