Challenges and opportunities for efficient computing with FAWN

  • Authors:
  • Vijay Vasudevan;David G. Andersen;Michael Kaminsky;Jason Franklin;Michael A. Kozuch;Iulian Moraru;Padmanabhan Pillai;Lawrence Tan

  • Affiliations:
  • Carnegie Mellon University;Carnegie Mellon University;Intel Labs Pittsburgh;Carnegie Mellon University;Intel Labs Pittsburgh;Carnegie Mellon University;Intel Labs Pittsburgh;Carnegie Mellon University

  • Venue:
  • ACM SIGOPS Operating Systems Review
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the architecture and motivation for a clusterbased, many-core computing architecture for energy-efficient, dataintensive computing. FAWN, a Fast Array of Wimpy Nodes, consists of a large number of slower but efficient nodes coupled with low-power storage. We present the computing trends that motivate a FAWN-like approach, for CPU, memory, and storage. We follow with a set of microbenchmarks to explore under what workloads these FAWN nodes perform well (or perform poorly), and briefly examine scenarios in which both code and algorithms may need to be re-designed or optimized to perform well on an efficient platform. We conclude with an outline of the longer-term implications of FAWN that lead us to select a tightly integrated stacked chip and-memory architecture for future FAWN development.