| | |
Summary: To appear in 22nd ACM Symposium on Operating Systems Principles (SOSP'09)
This version is reformatted from the official version that appears in the conference proceedings.
FAWN: A Fast Array of Wimpy Nodes
David G. Andersen1, Jason Franklin1, Michael Kaminsky2,
Amar Phanishayee1, Lawrence Tan1, Vijay Vasudevan1
1Carnegie Mellon University, 2Intel Labs
Abstract
This paper presents a new cluster architecture for low-power
data-intensive computing. FAWN couples low-power embed-
ded CPUs to small amounts of local flash storage, and balances
computation and I/O capabilities to enable efficient, massively
parallel access to data.
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. Our design centers around purely log-structured
datastores that provide the basis for high performance on flash
storage, as well as for replication and consistency obtained
using chain replication on a consistent hashing ring. Our eval-
|
