research highlights doi:10.1145/1965724.1 9 6 5 7 4 6

Technical Perspective FAWN: A Fast Array of Wimpy Nodes By Luiz André Barroso

systems thrives at the beginning and the end of technology cycles. When facing the limits of an existing technology or contemplating the applications of a brand new one, system designers are at their creative best. The past decade has been rich on both fronts, particularly for computer architects. CMOS technology scaling is no longer yielding the energy savings it used to provide across generations, resulting in severe thermal constraints leading to increased attention to so called “wimpy processors.” These processors achieve high performance and energy efficiency by using a larger number of low-to-modest-speed CPU cores. Also in the past decade, the consumer electronics industry’s investment in non-volatile storage technologies has resulted in NAND FLASH devices that are becoming competitive for general-purpose computing usage as they fit nicely within the huge cost/ performance gap between DRAM and magnetic disks. FLASH-based storage devices are over 100 times faster than disks, although at over 10 times the cost per byte stored. The emergence of wimpy processors and FLASH met a promising deployment scenario in the field of largescale data centers for Internet services. These warehouse-scale computing (WSC) systems tend to run workloads that are rich in request-level parallelism—a match for the increased parallelism of wimpy CPUs—and are very data intensive—a match for the high input-output rates that are possible with FLASH technology. The energy efficiency potential of both these tech-

I n n ovat i o n i n co m p u t i n g

100

co mm unicati on s o f the acm

nologies could help lower the substantial energy-related costs of WSCs. Given all this potential, how can we explain the rather slow pace of adoption of these technologies in commercial WSCs? At first glance, wimpy processors and FLASH seem compelling enough to fit within existing data center hardware and software architectures without the need for substantial redesign of major infrastructure components, thus facilitating rapid adoption. In reality, there are obstacles to extracting the maximum value from them. Hölzle1 summarized some of the challenges facing wimpy cores in commercial deployments, including parallelization overheads (Amdahl’s Law) and programmer productivity concerns. FLASH adoption has also suffered due to software related issues. FLASH will not fully replace disks for most workloads due to its higher costs, therefore storage system software must be adapt-

FAWN combines wimpy cores and FLASH to create an efficient, high-throughput, key-value storage system.

| j u ly 2 0 1 1 | vo l . 5 4 | n o. 7

ed to use both FLASH and disk drives effectively. The lesson here is that to extract the most value from compelling new technology one often needs to consider the system more broadly, and rethink how applications and infrastructure components might be changed in light of new hardware component characteristics. This is precisely what the authors of the following article on FAWN have done. FAWN presents a new storage hardware architecture that takes advantage of wimpy cores and FLASH devices, but does so alongside a new datastore software system infrastructure (FAWN-DS) that is specifically targeted to the new hardware component characteristics. The system is not a generic distributed storage system, but one that is specialized for workloads that require high rates of keyvalue lookup queries. By co-designing the hardware and software, and by targeting the system for a particular (but compelling) use case, the authors present a solution that has greater potential to realize the full value of new energy-efficient components. Their approach, which includes building and experimenting with actual software and hardware artifacts, is a model worthy of being followed by future systems research projects. Reference 1. Hölzle, U. Brawny cores still beat wimpy cores, most of the time. IEEE Micro (Aug/Sept. 2010). Luiz André Barroso ([email protected]) is a Distinguished Engineer at Google.

© 2011 ACM 0001-0782/11/07 $10.00

FAWN: a fast array of wimpy nodes: technical ... - Research at Google

particularly for computer architects. CMOS technology ... in the field of large- scale data centers for Internet services. ... nologies could help lower the substan-.

86KB Sizes 1 Downloads 229 Views

Recommend Documents

Fast and Wide Drive Array Industry 2016 Deep Market Research ...
2.6 Manufacturing Process Analysis of Fast and Wide Drive Array. Whoops! There was a problem loading this page. Fast and Wide Drive Array Industry 2016 ...

Fast Covariance Computation and ... - Research at Google
Google Research, Mountain View, CA 94043. Abstract. This paper presents algorithms for ..... 0.57. 27. 0.22. 0.45. 16. 3.6. Ropes (360x240). 177. 0.3. 0.74. 39.

Reference Nodes Entity Nodes Relationship Nodes - GitHub
SYSTEMS BIOLOGY GRAPHICAL NOTATION ENTITY RELATIONSHIP REFERENCE CARD. LABEL entity. LABEL phenotype. LABEL perturbing agent pre:label unit of information state variable necessary stimulation inhibition modulation. LABEL. NOT not operator outcome abs

TCP Fast Open - Research at Google
ABSTRACT. Today's web services are dominated by TCP flows so short .... 1. 10. Network Transaction Latency [s]. Cold Req. Cold Req no Hsk (sim). All Req.

Protractor: a fast and accurate gesture recognizer - Research at Google
CHI 2010, April 10–15, 2010, Atlanta, Georgia, USA. Copyright 2010 ACM .... experiment on a T-Mobile G1 phone running Android. When 9 training samples ...

A fast k-means implementation using coresets - Research at Google
Dec 5, 2005 - onds on one core of an Intel Pentium D dual core processor with 3 GHz core ..... KMHybrid was compiled using the same compiler and also.

AddressSanitizer: A Fast Address Sanity Checker - Research at Google
uses of freed heap memory, remain a serious problem for .... applications (as each malloc call requires at least one ... will behave incorrectly in a way detectable by existing ...... tional Conference on Virtual Execution Environments (VEE '07),.

Maglev: A Fast and Reliable Software Network ... - Research at Google
Google's traffic since 2008. It has sustained the rapid global growth of Google services, and it also provides network load balancing for Google Cloud Platform. 1 ...

A VLSI Array Processing Oriented Fast Fourier ...
key words: fast Fourier transform (FFT), array processing, singleton al- gorithm. 1. Introduction ... ment of Industry Science and Technology, Kitakyushu-shi, 808-. 0135 Japan. ..... Ph.D. degree in information & computer sci- ence from Waseda ...

reference nodes Entity Nodes Relationship Nodes - GitHub
S S EMS BIOLOG GRAPHICAL NO A ION EN I RELA IONSHIP REFERENCE CARD. LABEL entity. LABEL observable. LABEL perturbing agent pre:label.

SEMANTIC MODEL FOR FAST TAGGING OF ... - Research at Google
We focus on the domain of spo- ... vised knowledge resources, including Wikipedia and Free- .... pruned to a target size of 100 million n-grams and stored as.

MemorySanitizer: fast detector of uninitialized ... - Research at Google
propose an enhanced way of tracking origins of unini- tialized memory that ... byte of application memory; the shadow for every byte has 4 states: addressable and .... mum: conditional branch, system call and pointer derefer- ence. An attempt to ....

Computing Science Technical Report No. 99 A ... - Research at Google
phase of their job they had to build a large mechanism that included two or more ... paths to insure that the actual radio links were used at their maximum .... The first public demonstration of the complex computer took place on ..... At the end of

Entity Pool Nodes Container Nodes Process Nodes ... - GitHub
phenotype. LABEL perturbing agent pre:label unit of information val@var state variable. LABEL marker. LABEL clone marker. Source. EPN. N consumption. N production necessary stimulation inhibition stimulation. Target. PN modulation catalysis. Source.

Entity Pool Nodes Container Nodes Process Nodes ... - GitHub
Process Nodes. Connecting arcs. Logical Operators. Auxiliary Units. LABEL tag. LABEL unspecified entity. LABEL simple chemical. LABEL macromolecule.

Fast and Scalable Decoding with Language ... - Research at Google
Jul 8, 2012 - a non-commercial open source licence†. .... all bilingual and parts of the provided monolingual data. newstest2008 is used for parameter.

Fast Elliptic Curve Cryptography in OpenSSL - Research at Google
for unnamed prime and/or characteristic-2 curves (the OpenSSL elliptic curve library supports ..... ietf.org/html/draft-bmoeller-tls-falsestart-00. 11. ECRYPT II.

Fast, Compact, and High Quality LSTM-RNN ... - Research at Google
to-speech (TTS) research area in the last few years [2–20]. ANN-based acoustic models ..... pub44630.html, Invited talk given at ASRU 2015. [27] K. Tokuda, T.

RFC 7413 - TCP Fast Open - Research at Google
TFO is motivated by the performance needs of today's Web applications. Current ... a) the receiver host receives data in a duplicate SYN after it has forgotten it received .... and the server can regenerate the cookie independently, the best validati

An Algorithm for Fast, Model-Free Tracking ... - Research at Google
model nor a motion model. It is also simple to compute, requiring only standard tools: ... All these sources of variation need to be modeled for ..... in [5] and is available in R [27], an open source sys- tem for .... We will analyze the performance

Fast quantum methods for optimization - Research at Google
Feb 5, 2015 - We first provide a short summary of the SA method for optimization. ..... and each projector acts trivially on the ground state. To apply the gap ...

Fast Random Projections using Lean Walsh ... - Research at Google
∗Yale University, Department of Computer Science, Supported by NGA and AFOSR. †Google Research. ‡Yale University, Department of Mathematics, Program ...

TSum: Fast, Principled Table Summarization - Research at Google
Figure 2: Illustration of pattern expansion: The blue area indicates the saving .... For ADULT50-, the Local-Expansion algorithm wins, with a bit cost of 447, 477. The top .... Length: Theory and Applications, chapter A Tutorial. Introduction to the 

Gestalt: Fast, Unified Fault Localization for ... - Research at Google
Jun 20, 2014 - Internet services. DTL .... size, services offered, and network characteristics. The ..... For the system model, Gestalt uses a hybrid between.