Transcript
Page 1: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon1

ESE534Computer Organization

Day 19: March 28, 2012Minimizing Energy

Page 2: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon2

Today

• Discuss broad set of architectural options to reduce energy

• Relevant to upcoming project

Page 3: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon3

At Issue• Many now argue energy will be the

ultimate scaling limit– (not lithography, costs, …)

• Proliferation of portable and handheld devices– …battery size and life biggest issues

• Cooling, energy costs may dominate cost of electronics – Even server room applications

Page 4: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Microprocessor Power Density

Penn ESE534 Spring2012 -- DeHon4

The Future of Computing Performance: Game Over or Next Level?National Academy Press, 2011

http://www.nap.edu/catalog.php?record_id=12980

Watts

Page 5: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon Source: Carter/Intel 5

Power Limits Integration

Impact

Page 6: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Watch

• Energy optimized along with area, delay• Energy optimized with little or no effect

on area/delay• Energy trades off with area, delay

Penn ESE534 Spring2012 -- DeHon6

Page 7: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon7

Energy

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

Page 8: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon8

Energy

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

How scale down V?

Page 9: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon9

Energy and Delay

2

21 CVE

gd=Q/I=(CV)/I

Id,sat=(COX/2)(W/L)(Vgs-VTH)2

Page 10: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon10

Energy/Delay Tradeoff

• EV2

• gd1/V

• We can trade speed for energy• E×(gd)2 constant

Martin et al. Power-Aware Computing, Kluwer 2001 http://caltechcstr.library.caltech.edu/308/

2

21 CVE

gd=(CV)/IId,sat (Vgs-VTH)2

Page 11: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon11

Area/Time Tradeoff• Also have Area-Time tradeoffs

– HW2 spatial vs temporal multipliers– See more next week

• Compensate slowdown with additional parallelism

• …trade Area for Energy Architectural Option– HW3.3

Page 12: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce V

• Lower voltage and run in parallel– HW3.3

• Lower voltage when you can get away with it (as much as can get away with)– Dynamic Voltage Scaling

• Lower voltage where don’t need it– Multiple Vdd

Penn ESE534 Spring2012 -- DeHon12

Page 13: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon13

Energy

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

How reduce C?

Page 14: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce C• Shallow memory banks• Reduce overhead programmable

– Switches/stubs• Reduce wire lengths

– Maybe from reducing area• Size gates • Exploit technology• Specialize computation or compute element

Penn ESE534 Spring2012 -- DeHon14

Page 15: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon15

Energy

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

How reduce a?

Page 16: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce a• Avoid/reduce glitches• Code data

– Example FSM– Example data encoding– Example bus-invert– One hot

• Compress data (send less)• Exploit correlations• Power Gate unused regions

Penn ESE534 Spring2012 -- DeHon16

Page 17: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon17

Energy

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

How reduce CV2?

Page 18: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce CV coupling

• Low swing highly capacitive signals– Bit-lines– Interconnect?

Penn ESE534 Spring2012 -- DeHon18

Page 19: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon19

Energy

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

How reduce aC?

Page 20: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce aC

• Put high a with low C• Coding/compression at high C points

Penn ESE534 Spring2012 -- DeHon20

Page 21: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Total Energy

• Etotal = Eswitch+Eleak

Penn ESE534 Spring2012 -- DeHon21

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

E leak = Tcycle × V × Ileak

Page 22: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Total Energy

• Etotal = Eswitch+Eleak

Penn ESE534 Spring2012 -- DeHon22€

E =12

aiCiVi2 ⎛

⎝ ⎜ ⎞ ⎠ ⎟

i∑

E leak = Tcycle × V × Ileak

What if ai is small? Tcycle large?

Page 23: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Graph for In Class (Day 6)

Penn ESE534 Spring2012 -- Mehta & DeHon23

Page 24: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Leakage

Penn ESE534 Spring2012 -- DeHon24

E leak = Tcycle × V × Ileak

How reduce Tcycle?

Page 25: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce Tcycle

• Run as fast as can• Optimize for delay• Pipeline

Penn ESE534 Spring2012 -- DeHon25

Page 26: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Leakage

Penn ESE534 Spring2012 -- DeHon26

E leak = Tcycle × V × Ileak

How reduce V?

Page 27: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce V?

• Power gate power down when not in use

Penn ESE534 Spring2012 -- DeHon27

Page 28: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Leakage

Penn ESE534 Spring2012 -- DeHon28

E leak = Tcycle × V × Ileak

How reduce Ileak?

Page 29: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Reduce Leakage Current

• Power gating• Increase Vth

Penn ESE534 Spring2012 -- DeHon29

Page 30: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Admin

• HW9 – note parts to run on computer– Don’t wait until Sunday to run them

• Reading for Monday on web

Penn ESE534 Spring2012 -- DeHon30

Page 31: Penn ESE534 Spring2012 -- DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy

Penn ESE534 Spring2012 -- DeHon31

Big Ideas• Power major limiter going forward

– Can put more transistors on a chip than can switch

• Some optimizations good for energy as well as (area, delay)

• Some optimizations just for energy– No effect on area, delay

• Changes tradeoffs will make


Top Related