skip to main content
research-article
Free Access

FAWN: a fast array of wimpy nodes

Published:01 July 2011Publication History
Skip Abstract Section

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.

References

  1. Andersen, D.G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., Vasudevan, V. FAWN: A fast array of wimpy nodes. In Proceedings of the 22nd ACM Symposium on Operating Systems Principles (SOSP) (Big Sky, MT, October 2009). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Barroso, L.A., Hölzle, U. The case for energy-proportional computing. Computer 40, 12 (2007), 33--37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Memory-only or flash configurations. http://www.oracle.com/technology/documentation/berkeley-db/db/ref/program/ram.htmlGoogle ScholarGoogle Scholar
  4. Bowman, W., Cardwell, N., Kozyrakis, C., Romer, C., Wang, H. Evaluation of existing architectures in IRAM systems. In Workshop on Mixing Logic and DRAM, 24th International Symposium on Computer Architecture (Denver, CO, June 1997).Google ScholarGoogle Scholar
  5. Caulfield, A.M., Grupp, L.M., Swanson, S. Gordon: Using flash memory to build fast, power-efficient clusters for data-intensive applications. In 14th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'09) (San Diego, CA, March 2009). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chase, J.S., Anderson, D., Thakar, P., Vahdat, A., Doyle, R. Managing energy and server resources in hosting centers. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP) (Banff, AB, Canada, October 2001). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W. Dynamo: Amazon's highly available key-value store. In Proceedings of the 21st ACM Symposium on Operating Systems Principles (SOSP) (Stevenson, WA, Oct. 2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Hamilton, J. Cooperative expendable micro-slice servers (CEMS): Low cost, low power servers for Internet scale services, http://mvdirona.com/jrh/TalksAndPapers/JamesHamilton_CEHS.pdf (2009).Google ScholarGoogle Scholar
  9. Penryn Press Release. http://www.intel.com/pressroom/archive/releases/20070328fact.htmGoogle ScholarGoogle Scholar
  10. The Journaling Flash File System. http://sources.redhat.com/jffs2/Google ScholarGoogle Scholar
  11. Johnson, B. Facebook, personal communication (November 2008).Google ScholarGoogle Scholar
  12. Katz, R.H. Tech titans building boom. IEEE Spectrum (February 2009). http://spectrum.ieee.org/green-tech/buildings/tech-titans-building-boom Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Lamport, L. The part-time parliament. ACM Trans. Comput. Syst., 16, 2, (1998), 133--169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Lim, K., Ranganathan, P., Chang, J., Patel, C., Mudge, T., Reinhardt, S. Understanding and designing new server architectures for emerging warehouse-computing environments. In International Symposium on Computer Architecture (ISCA) (Beijing, China, June 2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nath, S., Gibbons, P.B. Online maintenance of very large random samples on flash storage. In Proceedings of VLDB (Auckland, New Zealand, August 2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nath, S., Kansal, A. FlashDB: Dynamic self-tuning database for NAND flash. In Proceedings of ACM/IEEE International Conference on Information Processing in Sensor Networks (Cambridge, MA, April 2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Polte, M., Simsa, J., Gibson, G. Enabling enterprise solid state disks performance. In Proceedings of the Workshop on Integrating Solid-State Memory into the Storage Hierarchy (Washington, DC, March 2009).Google ScholarGoogle Scholar
  18. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for Internet applications. August. 2001. http://portal.acm.org/citation.cfm?id=383071 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Szalay, A., Bell, G., Terzis, A., White, A., Vandenberg, J. Low power Amdahl blades for data intensive computing, 2009. http://portal.acm.org/citation.cfm?id=1740407&dl=ACM Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Tolia, N., Wang, Z., Marwah, M., Bash, C., Ranganathan, P., Zhu, X. Delivering energy proportionality with non energy-proportional systems---optimizing the ensemble. In Proceedings of HotPower (Palo Alto, CA, December 2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. van Renesse, R. Schneider, F.B. Chain replication for supporting high throughput and availability. In Proceedings of the 6th USENIX OSDI (San Francisco, CA, December 2004). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. FAWN: a fast array of wimpy nodes

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Communications of the ACM
            Communications of the ACM  Volume 54, Issue 7
            July 2011
            133 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/1965724
            Issue’s Table of Contents

            Copyright © 2011 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 July 2011

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Popular
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format