FAWN
David G. Andersen, Jason Franklin, Michael Kaminsky et al. · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · 2009
This paper presents a new cluster architecture for low-power data-intensive 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 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.
Cited by 561 works. doi:10.1145/1629575.1629577
Authors
References
- Chord
- The Google file system
- Xen and the art of virtualization
- Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
- MapReduce: Simplified Data Processing on Large Cluster
- The Case for Energy-Proportional Computing
- A case for redundant arrays of inexpensive disks (RAID)
- Dynamo
- The Google file system
- Scheduling for Reduced CPU Energy