ece 471 / 571 – energy- efficient vlsi...

61
Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006 ECE 471 / 571 – Energy- Efficient VLSI Design Dr. Patrick Chiang TAs: Tom Ruggeri; Brian Miller Winter 2012 Tues/Thurs 12PM-2PM Slides: Courtesy Prof. Nikolic (Berkeley), EECS 151, Spring 2006

Upload: buicong

Post on 18-Aug-2018

220 views

Category:

Documents


1 download

TRANSCRIPT

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

ECE 471 / 571 – Energy-Efficient VLSI Design

Dr. Patrick Chiang TAs: Tom Ruggeri; Brian Miller

Winter 2012 Tues/Thurs 12PM-2PM

Slides: Courtesy Prof. Nikolic (Berkeley), EECS 151, Spring 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Class Logistics Class Participation +/- Labs 1-6 %20 Homeworks 1-5 %10 Exam #1 (CMOS logic) %20 Exam #2 (Take-home exam -- sub-threshold logic design power) %20 Final Project %30

•  OH: TBD •  Lab Hours: Fri. 1-3PM; Tom Ruggeri

–  Class is VERY lab intensive –  HSPICE, unix, CAD

•  EXTRA GRADUATE STUDENT PROJECT

–  TA: Brian Miller

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Two ‘Project’ paths •  (1) Easy ‘Project’ course (recommended):

–  Advantages: •  Easy project: sub-threshold 4b multiplier •  Tool flow is easier (fictitious 0.25um process)

–  Cons: •  Won’t be able to build a real chip at the end •  May not understand the complexity of chip design

•  (2) Hard ‘Project’ course:

–  Only the MOST aggressive undergraduates should attempt; –  Graduate students are REQUIRED for this

–  Advantages: •  Design a high-speed I/O transceiver, considering all the

‘real-world’ difficulties

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

ECE471

•  Pass sheet of paper around to fill out: – Name – Why you are taking this class:

•  Need to graduate; need easy A; want to build something interesting; want to get a job; want to be famous; want to make lots of money;

– Which project choice you would like •  Do you really want to do the ‘HARD’ project?

– Decide who your partner will be •  This person better be on the same page as you

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Big Picture

•  Three main issues in technology: – POWER – VARIABILITY – PERFORMANCE through PARALLELISM

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Multiple Processors on Single Chip

•  Two processors on single-chip •  Two chips(w/ two processors) in single package

•  16 – 64 – 256 processors on single die –  PicoChip –  Stream Processors –  Sun Niagara –  Tilera –  Ambric –  (show examples from images.google.com)

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Original Moore’s Law paper

•  ftp://download.intel.com/research/silicon/moorespaper.pdf

•  “Cramming more components onto integrated circuits”

•  Heat problem: Will it be possible to remove the heat generated by tens of thousands of components in a single silicon chip?

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006 [2]

More  transistors  than  you  have  power  

Gap widening > 100x

‘DARK SILICON’

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Not  enough  power  available  

!"#

$!"#

%!"#

&!"#

'!"#

(!"#

)!"#

*!"#

+!"#

,!"#

$-!!./!+#

$-!!./!,#

$-!!./$!#

$-!!./$$#

%!$!# %!$$# %!$%# %!$&# %!$'# %!$(# %!$)# %!$*# %!$+# %!$,# %!%!#

01234#

541673#

891:2;<=#><?393@#

!"#$%&'(')*+%

Source: Bill Dally, 2011

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Need  more  off-­‐chip  bandwidth  

Aggregate Microprocessor I/O Bandwidth*

*F. O’Mahoney et al, “The Future of Electrical I/O for Microprocessors," VLSI-DAT, 2009.

DDR3: 100GB/s Local Links: ~20GB/s

IBM  Power-­‐7  (2009)  

nVidia  Fermi  (2010)  

GDDR5: 200GB/s

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

QUESTIONS / BREAK

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Slides courtesy: Prof. Nikolic (UC Berkeley) EECS 141, Sprint 2006

Lecture #1 finished