Download Transient Power Drop on Timing

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Pulse-width modulation wikipedia , lookup

Ohm's law wikipedia , lookup

Current source wikipedia , lookup

Power inverter wikipedia , lookup

Variable-frequency drive wikipedia , lookup

Power engineering wikipedia , lookup

Resistive opto-isolator wikipedia , lookup

Three-phase electric power wikipedia , lookup

Electrical substation wikipedia , lookup

Rectifier wikipedia , lookup

History of electric power transmission wikipedia , lookup

Islanding wikipedia , lookup

Opto-isolator wikipedia , lookup

Buck converter wikipedia , lookup

Stray voltage wikipedia , lookup

Rectiverter wikipedia , lookup

Alternating current wikipedia , lookup

Switched-mode power supply wikipedia , lookup

Voltage optimisation wikipedia , lookup

Mains electricity wikipedia , lookup

Transcript
IBM Microelectronics
Bounding the Impact of Transient
Power Supply Noise in Static Timing
Analysis Over a Realistic Activity Space
David Hathaway
April 2, 2005
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Outline
 Background and problem description
 Prior work
 This work
– Modeling realizable patterns of activity
– Determining peak voltage variation
– Determining bounding timing conditions
– Applications to design planning
 Remaining issues
2
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Power supply networks as System-Level Interconnect
 Power supply networks do communicate information
– Power demand in one place affects voltages in others
Northeast blackout
August 14, 2003
3
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Problem addressed
 Determine maximum impact of transient power supply noise on chip
timing
Delay variation
Vdd
Vdd
Vdd
Vdd
VDD
Board /
Package
Vdd
Voltage
waveform
Vdd
Object
switching
4
SLIP 2005
Current waveform
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Why is this becoming more important?

Power density is increasing (again)
Steam Iron
5W/cm2
Why Hot Chips Are no Longer “COOL” - Ray Bryant
5
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Why is this becoming more important?
 Delay sensitivity to supply voltage is increasing
– Due to voltage reductions needed to contain power density
Delay
Rise & fall
delays of
2-way AND
Supply
voltage
6
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Power Supply Noise – Voltage Response
A trivial network model demonstrates key noise characteristics:
VDD
t=0
Board / Package
Chip
What is the “circuit’s view” voltage response to the switching current
signature illustrated above?
7
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Voltage Response At Circuit Terminals
+
v(t)
-
Static IR Drop
Steady-State
AC Response
Step Response
8
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Delay dependence on voltage
 Traditional models use a single supply voltage per gate
– Reality is more complicated
Drive (& hence delay)
of gate G2 is a
function of Vdd & Gnd
of both G1 and G2
Most power supply
noise is differential
(Vdd drops as Gnd
rises)
9
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Why is it hard to find the worst timing impact?
 Naïve approach
– Determine worst voltage at each node (max Gnd, min Vdd)
– Time circuit with these voltages
 Problems
– Timing test compare early/late clock/data
– Worst slack (for setup test) when data is slow relative to clock
Max voltage drop
Max delay
10
SLIP 2005
Max voltage drop gradient
Worst slack
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Outline
 Background and problem description
 Prior work
 This work
– Modeling realizable patterns of activity
– Determining peak voltage variation
– Determining bounding timing conditions
– Applications to design planning
 Summary
11
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Use superposition to determine worst timing
 Vectorless Analysis of Supply Noise Induced Delay Variation,
S. Pant, D. Blaauw, et. al., U. Michigan, ICCAD 2003
– Bound current demand at each power network node
– Simulate current impulse applied at each power network node
– Model delay linearly with voltage
– Use delay model & power network response to model path delay
as function of current at each node in each cycle
– Use linear optimizer to determine current profiles which give
worst path delay
– Use spatial and temporal superposition of voltage waveforms
12
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Spatial superpositioning
 Compute voltage waveforms for different aggressors
 Add selected waveforms with no time shifting
A
+ =
A
B
B
A
B
13
SLIP 2005
+ =
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Temporal superpositioning
 Compute voltage waveforms for one cycle of each aggressor (simulate until
transients die out)
 Add time shifted copies of waveform to get impact of operation over many
cycles
Current
Voltage
drop
Steady
state
voltage
drop
14
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Use superposition to determine worst timing
0
1
n
0
0
0
1
1
2
2
n
n
…
1
n
A
B
∑
J(i,j)
…
V(0,0)
V(n,n)
15
SLIP 2005
Find ∆Jij to maximize Dpath
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Limitations of prior work
 Cannot easily restrict analysis to realizable activities
– Allows only linear constraints between current weights
 Path-oriented analysis
– Subject to exponential path enumeration issues
 Assumes constant voltage within cycle
– Loses high frequency variation
16
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Constraints on realizable activities
 Example – either banks 0 & 1 switch or bank 2 switches or bank 3
switches
0
1
2
p2
3

Banks with worst effect differ for
paths p1 and p2

Cannot constraint total switching
– S(0) + S(1) > S(2) or S(3) alone

Cannot constrain relation between
banks
– S(0), S(1) > S(2) for p1
– S(2) > S(0), S(1) for p1
p1
17
SLIP 2005

Selection of worst banks is not a
linear problem
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Constraints on realizable activities
 Example – clock dithering to limit noise from clock gating
Unconstrained
Dithered
18
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Outline
 Background and problem description
 Prior work
 This work
– Modeling realizable patterns of activity
– Determining peak voltage variation
– Determining bounding timing conditions
– Applications to design planning
 Summary
19
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Overview of our approach
 Identify “objects of interest” (OOIs)
– Large or high power cores of SOC
– Regions of random logic
 Simulate voltage drops due to each OOI
 Determine allowable patterns / sequences of activity for OOIs
– Modeled as BDDs
 Determine max / min v(t) for each node
 Use min / max v to screen, find critical subnetwork
 Use block-based statistical timing with OOI activities as variables to
refine timing
 Determine worst slack for each timing test within allowable
sequences
 Reanalyze paths with nonlinear delay dependencies to validate /
refine slacks
20
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Simulating OOI currents
 Use fast linear power grid simulator
– Uses fixed time step, explicit matrix inversion
• Initial overhead
– Allows very fast simulation of many waveforms
– Changing OOI currents, location of application is very fast
– Changing power grid (or adding decoupling caps) is slower
21
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Modeling allowable conditions
 Determine set of conditions which must be met
– Model as Boolean functions of OOI activity in different cycles
– Examples
• No more than k of n memory banks switch in one cycle
• Clock cannot have X cycles off followed by Y cycles on
F
 Represent AND of all conditions as BDD
0
– One BDD for all chip constraints
0
1
– Subsequent steps depend linearly on BDD size
– … so aggressively reorder for minimum size
SLIP 2005
1
x2
– Variables are activity of OOIs in particular cycles
22
x1
April 2, 2005
0
0
x3
1
1
© 2005 IBM Corporation
IBM Microelectronics
Finding extreme voltages
 DFS traversal of constraint BDD
– One traversal per node, per alignment in cycle
– Assign weights to BDD variables based on voltage of node at alignment time
due to OOI switching in a particular cycle
– Determine extreme (min/max) value at each node
Va(t)
T
2T
3T
T
2T
3T
T
2T
3T
Va(t+T)
Vb(t)
23
SLIP 2005
April 2, 2005
…
© 2005 IBM Corporation
IBM Microelectronics
Finding extreme voltages
 For each node / alignment
– ∆Vi = delta voltage when OOIi is active
– Min value Vmin(n) at BDD node n with variable l(n), children c0(n), c1(n):
0 child
value
l ( n ) -1


V
(
c
0
(
n
))

min(0,

V
)
,

i
 min

i  l(c 0 ( n )) 1


Vmin (n) = min 

l ( n ) -1
V (c1(n))  V 
min(0, Vi )

min
l(n )


i  l(c1( n )) 1
1 child


value
– Vmin(0)=+infinity, Vmin(1)=Vnom
Variables
skipped by
0 edge
Variables
skipped by
1 edge
Contribution
of this OOI
switching
– Vmin of root is min realizable voltage
– Similar form for max voltage
24
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Finding extreme voltages
 Example
V1 = -0.1
V2 = -0.25
1.43
2
V3 = +0.18
1.68
3
-infinity
0
Node / offset 1
25
1
SLIP 2005
1.25
2
1
April 2, 2005
1.25
1.5
© 2005 IBM Corporation
IBM Microelectronics
Finding extreme voltages
 Example
V1 = -0.15
V2 = -0.15
1.48
2
V3 = +0.13
1.63
3
-infinity
0
Node / offset 2
26
1
SLIP 2005
1.33
2
1
April 2, 2005
1.35
1.5
© 2005 IBM Corporation
IBM Microelectronics
Application to timing
1. Use min (late) / max (early) voltages to filter errors
2. Apply block-based statistical timing to remaining regions

Delay / Arrival times / slacks are functions of OOI activity
a0  a1X1  a2X 2    an X n  an1Ra

Max / min propagated statistically

Sample waveform voltages at mean arrival time

Result is slack equation for each test

27
Find worst slack by BDD traversal
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Block-based statistical timing
 Deterministic
a
+
c
+
MAX
b
 Statistical
a
+
+
c
MAX
b
28
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Waveform sampling for delay calculation
...
1. Get arrival time t
3. Compute delay
4. Get arrival time t
2. Get V(t)
29
SLIP 2005
6. Compute delay
5. Get V(t)
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Applications to Design Planning
 Get OOI locations from floorplan
 Determine extreme voltages
– Detailed paths not yet known, so can’t apply to timing
– Impose bounds on voltage
 Modifications to fix errors
– Add decoupling caps
• Only useful for short transient limit violations
– Move OOIs
– Impose restrictions on allowed activity patterns
30
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Updating voltage extremes
Object movement
Activity
constraint
changes
medium
OOI current
location
fast
Power grid
simulations
OOI activity
restriction
Power grid
model build
slow
Power grid
changes
31
Decap
changes
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
(Some) remaining issues
 Current depends on voltage
– Ignored by superposition approach
 Block-based statistical timing may not apply well
– Need to validate predicted worst activity patterns
– Fall-backs - use path-based approach
 Picking the right set / granularity of OOIs
 Determining activity constraints
– Need links to system-level modeling
32
SLIP 2005
April 2, 2005
© 2005 IBM Corporation
IBM Microelectronics
Acknowledgements
 Thanks to many people in IBM working on these issues, and
in particular:
– Ivan Wemple
– Chandu Visweswariah
– Sani Nassif
– Doug Stout
– Kerim Kalafala
33
SLIP 2005
April 2, 2005
© 2005 IBM Corporation