Loading...
Please wait, while we are loading the content...
Similar Documents
FAWN: A Fast Array of Wimpy Nodes (2009)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kaminsky, Michael Andersen, David G. Franklin, Jason Phanishayee, Amar |
| Abstract | This paper presents a new cluster architecture for low-power dataintensive computing. FAWN couples low-power embedded 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 keyvalue 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. |
| File Format | |
| Publisher Date | 2009-01-01 |
| Publisher Institution | Proc. 22nd Symposium on Operating Systems Principles |
| Access Restriction | Open |
| Subject Keyword | Key Contribution Small Amount Balance Computation Chain Replication Fawn Prototype Disk-based System New Cluster Architecture Local Flash Storage Low-power Dataintensive Computing Flash Storage High Performance Parallel Access Consistent Hashing Ring Fawn Cluster High-performance Keyvalue Storage System Fast Array Log-structured Datastores Fawn Architecture Wimpy Node Embedded Cpu Design Center Key-value Query |
| Content Type | Text |
| Resource Type | Conference Proceedings |
