FAWN
Authors:
Open Access
- 1 July 2011
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 54 (7) , 101-109
Abstract
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, 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 evaluation demonstrates that FAWN clusters can handle roughly 350 key-value queries per Joule of energy---two orders of magnitude more than a disk-based system.Keywords
Funding Information
- Division of Computing and Communication Foundations (CCF-0964474)
This publication has 12 references indexed in Scilit:
- FAWN2009
- Gordon2009
- Tech Titans Building BoomIEEE Spectrum, 2009
- Online maintenance of very large random samples on flash storageProceedings of the VLDB Endowment, 2008
- Understanding and Designing New Server Architectures for Emerging Warehouse-Computing Environments2008
- The Case for Energy-Proportional ComputingComputer, 2007
- Dynamo2007
- FlashDB2007
- Managing energy and server resources in hosting centers2001
- The part-time parliamentACM Transactions on Computer Systems, 1998