University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Scale-Out Processors

Scale-Out Processors

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

A growing number of today’s most relevant applications are served online and run in large-scale datacenters characterized by thousands of servers and multi-megawatt power budgets. As Dennard scaling comes to a halt, experts are projecting exponential growth in datacenter power and performance requirements in the coming decade, driven by the rising popularity of the online service model. To efficiently meet the computing needs in the post-Dennard era, datacenters will rely on a new form of ISA – Integration, Specialization, and Approximation.

As a first step toward this post-Dennard ISA , we have developed Scale-Out Processors – a processor design methodology that maximizes performance per TCO on scale-out workloads running in large-scale datacenters. Using a metric of performance density, our methodology facilitates the design of optimal configurations, called pods, of core, cache, and interconnect building blocks. Each pod is a stand-alone server-on-chip, a feature that avoids the expense and complexity of global (i.e., inter-pod) interconnect and coherence support. As I will show, Scale-Out Processors enable higher performance, lower TCO , and better technology scalability over existing design alternatives.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity