Affiliation:
1. Carnegie Mellon University
2. Intel Labs
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.
Funder
Division of Computing and Communication Foundations
Publisher
Association for Computing Machinery (ACM)
Reference21 articles.
1. FAWN
2. The Case for Energy-Proportional Computing
3. Memory-only or flash configurations. http://www.oracle.com/technology/documentation/berkeley-db/db/ref/program/ram.html Memory-only or flash configurations. http://www.oracle.com/technology/documentation/berkeley-db/db/ref/program/ram.html
4. Gordon
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献