dehon-workshop fpt 2009 1 architecture of fpgas as future computing platforms (with workshop...

80
DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon [email protected]

Post on 22-Dec-2015

217 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

1

Architecture of FPGAs as Future Computing Platforms

(with workshop discussion annotations)

André DeHon

[email protected]

Page 2: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

2

State of FPGAs

Page 3: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

3

Lattice quoting: iSuppli, “Competitive Landscaping Tool - Q1 2009,” March 6, 2009

State of FPGAs• Modest Market Share

Page 4: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

4

State of FPGAs

• Modest Market Share

• Growing starts– “Gartner reported that FPGAs now have a

30-to-1 edge over ASICs in design starts.” • EDN, March 2009

Page 5: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

5

State of FPGAs

• Modest Market Share

• Growing starts– Growing starts– But low total volume– Generally low-volume products

• Slow overall market growth

Page 6: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

6

State of FPGAs

• Modest Market Share• Growing starts

– Growing starts– But low total volume– Generally low-volume products

• Slow overall market growth• “Cool” kids are programming

– GPGPUs, Multicore

Page 7: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

7

Hand-me-Down

• Technology process– Designed for needs of processors, RAMs

• Programming– Verilog, VHDL design for fixed-function devices– C designed for ISA processors– CUDA design for GPUs

• Benchmarks– Toronto 20 (logic syntehsis)– Spec (processors)– LINPAK (supercomputers)

Page 8: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

8

This Session Considers

• What does the future look like?

• Does it have to be like the past?

• How impacted by silicon scaling?

• What will it take for FPGAs to take over?

Page 9: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

9

Session Outline

• FPGA– Weaknesses– Negative stereotypes

• Strength of Alternatives

• FPGA Strengths• Big challenges for

late silicon era

• How can alternatives lose?

• How can FPGAs win?

• Questions worth thinking about?– (research directions)

Interactive, opinions, consensus, tight time budget….

Page 10: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

10

Why do Today’s FPGAs Suck?

• Weaknesses [real and perceived]– Self-criticism

• Stereotypes– Catharsis

[Budget 3min]

Page 11: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

11

Why do Today’s FPGAs Suck?(from audience discussion)

• High power• Hard to program• High per part cost• Too slow• Low Utility (compared to

ASIC?)• Inefficient use of area• Tools suck

• Low Floating-Point performance

• Unpronounceable Acronym

• Unpredictable timing• Not reprogrammable• Poor man’s ASIC

replacement• Insecure

Page 12: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

12

Why do Today’s FPGAs Suck? (weaknesses [real and perceived])

• High learning curve (entry)• Hard to extract performance

– (master and repeat)

• Long tool times• No standards• Limited reuse, portability• No scalable design capture

– (must redesign)

Page 13: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

13

Negative Stereotypes

• Slow/expensive/power-hungry ASICs• Slow compared to processors• Only for prototyping

– "Real" designs on ASICs• Only for low-volume products

– Successful, high-volume designs use ASICs• Only for control and interfacing

– tech-support geek only; can't have starring role• HARDware emphasis on hard• Non-scalable solutions

Page 14: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

14

Strengths of Processors

[Budget 2min]

Page 15: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

15

Strengths of Processors (from audience discussion)

• Flexible• Scalable

– Backward compatible

• Ease of Reuse• Have ISA• Compiler Targetable• Fast Compile

• Good compilers• Good debug support

and visibility• Good abstractions

– E.g. unbounded memory

• Lots of programmers

Page 16: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

16

Strengths of Processors (single core)

• Preserve investment – Ride tech curve; old code runs faster

• Millions of programmers• Easy to program

– Invest in teaching everyone to program• Ubiquitous• Cheap• Volume shipped, easy to get hands on• Rich development tools, standards• Fast compilation• Fast enough to handle most real-time tasks today• General-purpose, can be programmed to do

“anything”

Page 17: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

17

Strengths of Multicore Processors

• Lower power per op than monolithic, insane-way superscalar

• Becoming ubiquitous– The anointed “wave” of the future

• Can reuse single-processor know-how

Page 18: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

18

Strengths of GPGPU

[Budget 2min]

Page 19: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

19

Strengths of GPGPU (from audience discussion)

• Higher compute density than processors• More power efficient than processors• Ubiquitous• Higher throughput than processors• Have standards, scalability• Efficient use of Instruction Memory• Good single-precision floating-point performance• High throughput I/O• Fast Tools• Good Visualization

Page 20: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

20

Strengths of GPGPU

• Greater computational throughput than processors– At least for single-precision floating-point

• Programmable• Easy to program data-parallel tasks• Shipping in 100s of millions• Easy add-ons, build out• Investment preserving

Page 21: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

21

Strengths of ASICs

[Budget 1min]

Page 22: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

22

Strengths of ASICs (from audience discussion)

• Low Cost (in volume)

• Low Power

• High Performance (on task)

• Fun

• Well-developed tool flow

• Compact

Page 23: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

23

Strengths of ASICs

• Get just what you need– Remove all that general-purpose overhead

• On task– Lower power– Higher computational density

Page 24: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

24

Strength of FPGAs

[Budget 2min]

Page 25: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

25

Strength of FPGAs (from audience discussion)

• Field Programmable = flexible and general-purpose – Future protecting

• Low NRE• High profit margins?• Customizable memory and I/O• Can tune to task• Allow reuse of hardware• Easier to debug than ASICs

Page 26: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

26

Strength of FPGAs

• Programmable

• Adapt to needs of computation

• High computational density

• High memory bandwidth

• ? Power

Page 27: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

30

Fundamental FPGA Characteristics

• Fine-grained building blocks– Compute– Memory– Interconnect

• Spatially distributed• Spatially configured

i.e. Array of 32-bit seq. processors is not an FPGA.

2-bit datapath array with random config read/write is.

Page 28: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

31

FPGA Strengths/WeaknessesFundamental to Architecture?

+ Programmable

+ Adapt to needs of computation

+ High compute density

+ High memory bandwidth

- High learning curve

- Hard to extract performance

- Long tool times

- Power hungry

- No standards; limit reuse, portable

- Non-scalable design capture[Budget 3min]

Page 29: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

32

FPGA Strengths/WeaknessesAccurate/Fundamental?

Property Accurate Fundamental

- High Power Compared to asic, yes

- Hard to Program Yes No

- High per part cost ?

- Too slow No*

- Low utilization Yes Yes

- Inefficient use of area ?

- Tools suck Yes No

- Low Floating-Point Performance No

- Not Reprogrammable No

Page 30: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

33

FPGA Strengths/WeaknessesAccurate/Fundamental?

Property Accurate Fundamental

- Unpredictable Timing Yes No

- Poor Man’s ASIC Yes No

- Insecure Yes No

+ Flexible, GP, future-preserving Yes Yes

+ Low NRE Yes Yes

+ Customizable memory and I/O Yes Yes

+ Can tune to task Yes Yes

+ Allow reuse of hardware Yes Yes

+ Easier to debug than ASICs Yes Yes

Page 31: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

34

FPGA Strengths/WeaknessesFundamental to Architecture?

+ Programmable yes

+ Adapt to needs of computation yes

+ High compute density yes

+ High memory bandwidth yes

- High learning curve no

- Hard to extract performance no

- Long tool times no

- Power hungry some

- No standards; limit reuse, portable no

- Non-scalable design capture no

Page 32: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

35

Big Challengesfor Late Silicon Era

Page 33: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

36

Big Challenges next 10 Years

[Budget 3min]

Page 34: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

37

Big Challenges next 10 Years (from audience discussion)

• Power Density

• Leakage

• Variability

• Good Tools – deal with device capacity

• Smaller packages ?

• Reliability

Page 35: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

38

Big Challenges

• Power– Can put more transistors on a chip than we

can operate

• Reliability– Cannot expect them all to work any more

• NRE– Can only afford very high volume parts

• Design Productivity– Bottleneck is human time to put all those

transistors to use

Page 36: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

39

Challenge: Power

Page 37: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

40

Origin of Power Challenge

• Limited capacity to remove heat– ~100W/cm2 force air– 1-10W/cm2 ambient

• Transistors per chip grow at Moore’s Law rate = (1/F)2

• Energy/transistor must decrease at this rate to keep constant

• E/tr CV2f– V scaling more slowly than F

Page 38: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

41

ITRS Vdd Scaling:V Scaling more slowly than F

Page 39: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

42

CV2 scaling from ITRS:More slowly than (1/F)2

Page 40: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

43

Origin of Power Challenge

• Transistors per chip grow at Moore’s Law rate = (1/F)2

• Energy/tr must decrease at this rate to keep constant

• E/tr CV2f

Page 41: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

44

Historical Power Scaling

[Horowitz et al. / IEDM 2005]

Page 42: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

47

Challenge: Reliability

Page 43: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

48

RelXLayer: August 200948

Reliability• Fewer dopants, atoms increasing Variation

– Must margin over wider range of devices

• Increasing Transistors / chip– More things to go wrong, sample extreme devices

• Decreasing critical charge– Increasing upset rates

• Decreasing opportunities for burnin– More devices fail in field

• Increasing wear-out effects– Shorter lifetime and/or larger margins

Page 44: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

49

• Margins growing due to increasing variation

• Fixed-function designs stuck with manufacturing delays

• System performance is the worst-case path– Leakage is worst-case devices

• More devicesMore pathsMore chances of bad paths

• Further limiting Vdd scaling

Variations

Pro

babi

lity

Dis

trib

utio

n

Delay

New

Old

Page 45: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

50

End of Energy Scaling?

[Bol et al., IEEE TR VLSI Sys 17(10):1508—1519]

Black nominalGrey with variation

Page 46: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

51

Power and Reliability

• Intersection is the challenge

• Push Vdd in opposite directions

• Both reach inflection points– From doesn’t matter – To major concern

Page 47: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

52

Challenge: NRE

Page 48: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

53

NRE Costs

Page 49: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

54

Economics

• Economics force fewer, more customizable chips– Mask costs approaching millions of dollars– Custom IC design NRE tens of millions of dollars

• Need market of hundreds of millions of dollars to recoup investment

• With fixed or slowly growing total IC industry revenues Number of unique chips must decrease

Forcing fewer,more customizablechips

Page 50: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

55

Challenge: Designer Productivity

Page 51: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

56

DOMAIN SPECIFIC

RTL

GATE

TRANSISTOR

BEHAVIORAL

Design Productivity by Approach

a

b

s

q0

1

d

clk

GATES/WEEK(Dataquest)

100 - 200

1K - 2K

2K - 10K

8K - 12K

10 - 20

Source: Keutzer (UCB EE 244)

Page 52: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

57

Productivity

• At 10K gates / week• 1M “gate” FPGA design

– 100 man weeks 2 man years!

• Yes, we can program the FPGA fast– …but still slow (expensive) to develop the

design

• Also holding back ASICs– Why FPGAs capacities are good enough

Page 53: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

58

Implications

Page 54: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

59

How can Processors Lose?

[Budget 2min]

Page 55: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

60

How can Processors Lose? (from audience discussion)

• Hard to program in multicore era• Genericpower problems• Single thread performance no longer scales• Yield (every transistor must work)• Hard to extract performance• Variabilityslow• Memory NRE ???• More reliant on OS?

Page 56: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

61

How can Processors Lose?

• Too much power– Little of their power goes into the actual

computation

• Reliability: too coarse-grained– Variability and power end beneficial scaling– No access to most advanced fabs

• Programmability (multicore)

Page 57: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

62

Pentium Pro Energy Breakdown

[Bose, Martinosi, Brooks / Sigmetrics 2001]

Page 58: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

63

Embedded Processor

[Dally et al. / Computer 2008]

Page 59: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

64

Energy

[Abnous et al, The Application of Programmable DSPs in Mobile Communications, Wiley, 2002, pp. 327-360 ]

Page 60: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

65

How can GPGPUs lose?

[Budget 2min]

Page 61: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

66

How can GPGPUs lose? (from audience discussion)

• SIMD too limiting

• Don’t run legacy ISA software

• Insufficient local memory

• Memory bandwidth bottleneck

• Yield (granularity)

• Insufficient Programmability

Page 62: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

67

How can GPGPUs lose?

• Too much power– Paying huge power for non-local memory

bandwidth

• Reliability: too coarse-grained– Variability and power end beneficial scaling– No access to most advanced fabs

• Limited programmability – Not solve enough problems well

Page 63: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

68

How can ASICs lose?

[Budget 1min]

Page 64: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

69

How can ASICs lose? (from audience discussion)

• Too expensive– NRE– Design Productivity

• Too long Time-To-Market

• Lack of programmability/flexibility Low Yield and product lifetime

• Tools expensive and hard to use

Page 65: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

70

How can ASICs lose?

• NRE too high– Mask costs– Working out manufacturing/reliability issues

• Design productivity– Cannot afford to design something large enough

to demand extra capacity

• Reliability: no opportunity for scaling– Variability and power end beneficial scaling– No access to most advanced fabs

Page 66: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

71

How can FPGAs win?

[Budget 3min]

Page 67: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

72

How can FPGAs win? (from audience discussion)

• Redundancy

• Better programming languages

• Late bindingmap around process variation

• Vendor neutrality

• Ready for a good model

• Share NRE

Page 68: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

73

How can FPGAs win? (1)

• Reliability: post-fab, fine-grained configurability gives access to better technology– Power win from smaller feature size– Power win from lower voltage operation– Discard little when units bad

Page 69: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

74

Fine-Grained Reconfiguration

• Selecting devicesrole mapping after fabrication is powerful.– Mitigation fabrication

statistics• Defects• variation

– Mitigate lifetimechanges

• FPGA-like architectures have a potential head-start over alternatives.

Page 70: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

75

How can FPGAs win? (2)

• Programmable to be efficient in domains not supported by GPGPUs and Processors– Local, spatial interconnect– Low latency communications– Specialized functional units

• Examples:– Graph problems, network processing, cryptography– Vision?

Page 71: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

76

How can FPGAs win? (3)

• Adaptable in system– Reliability: aging– Environment: temperature, upset rate– Application data set– Application computing needs

Page 72: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

77

How can FPGAs win? (4)

• Power: fine-grained programmability minimizes what switches

Page 73: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

78

How can FPGAs win? (5)

• Big enough

• Fast enough

• Think: Innovator’s Dilemma

Page 74: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

79

How can FPGAs win? (6)

• Must address:– Designer productivity– Scaling– Reuse– Standards– Easy access to exploit strengths

High-Level Models and Architectures

Page 75: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

80

Patterns for Parallelism

SPMD(CUDA)Streaming

(SCORE)

Actor-Oriented(GraphStep)

CellularAutomata

Transactional

WorkFarm

Sequential Control(BSP)

SpecializedInterpreter

FPGAs can potentially support all…and can mix-and-match…

Page 76: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

81

Prognosis

• Architecturally -- alternatives will have to become more like FPGAs to survive.

• Software/model wise – FPGAs still have a lot to learn from alternatives.

Page 77: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

82

Questions to Think About

• In light of coming challenges, what are the big questions we should be thinking about in FPGA Architecture and Systems?– What should research be trying to answer?

[Budget 4min]

Page 78: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

83

Questions to Think About (from audience discussion)

• Design at higher abstraction levels• Design portability and scalability to future

chips• Solve parallel programming problem• Reduce CAD runtime

– Time to first run

• Lower designer expectations?– help understand TTM vs. performance tradeoffs– find favorable points on curve

• Exploit post-fab configuration

Page 79: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

84

Questions to Think About

• Granularity – Balance reliability and overhead– Avoid tradeoff?

• Compute models– Exploit strengths, ease design, scalability

• Simplify performance programming– Including low energy

• Flexibility metrics (value of fine-grained prog.)• Efficiency over range of environments • Adaptability

Page 80: DeHon-Workshop FPT 2009 1 Architecture of FPGAs as Future Computing Platforms (with workshop discussion annotations) André DeHon andre@seas.upenn.edu

DeHon-Workshop FPT 2009

85

Conclusions

• Coming challenges promise a shake-up– Power, reliability, NRE, design productivity

• Many effects point in the direction of FPGA architecture– Also suggest directions for FPGA evolution

• We are not doing a good job of making FPGA strengths accessible

• Must take an aggressive lead– Address weaknesses– Demonstrate FPGA readiness to address

challenges