Caltech CS184 Winter2003 -- DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 12: February 5, 2003 Interconnect 2: Wiring Requirements.

Slides:



Advertisements
Similar presentations
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day6: October 11, 2000 Instruction Taxonomy VLSI Scaling.
Advertisements

Balancing Interconnect and Computation in a Reconfigurable Array Dr. André DeHon BRASS Project University of California at Berkeley Why you don’t really.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 11: March 4, 2008 Placement (Intro, Constructive)
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 9: February 20, 2008 Partitioning (Intro, KLFM)
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 15: March 12, 2007 Interconnect 3: Richness.
CS294-6 Reconfigurable Computing Day 8 September 17, 1998 Interconnect Requirements.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day10: October 25, 2000 Computing Elements 2: Cascades, ALUs,
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day8: October 18, 2000 Computing Elements 1: LUTs.
EDA (CS286.5b) Day 5 Partitioning: Intro + KLFM. Today Partitioning –why important –practical attack –variations and issues.
DeHon March 2001 Rent’s Rule Based Switching Requirements Prof. André DeHon California Institute of Technology.
CS294-6 Reconfigurable Computing Day 10 September 24, 1998 Interconnect Richness.
Penn ESE Fall DeHon 1 ESE (ESE534): Computer Organization Day 19: March 26, 2007 Retime 1: Transformations.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 13: February 26, 2007 Interconnect 1: Requirements.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.
CS294-6 Reconfigurable Computing Day 15 October 13, 1998 LUT Mapping.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 16: March 14, 2007 Interconnect 4: Switching.
Balancing Interconnect and Computation in a Reconfigurable Array Dr. André DeHon BRASS Project University of California at Berkeley Why you don’t really.
Penn ESE Spring DeHon 1 FUTURE Timing seemed good However, only student to give feedback marked confusing (2 of 5 on clarity) and too fast.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 14: February 28, 2007 Interconnect 2: Wiring Requirements and Implications.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 13: February 4, 2005 Interconnect 1: Requirements.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 15: February 12, 2003 Interconnect 5: Meshes.
ESE Spring DeHon 1 ESE534: Computer Organization Day 19: April 7, 2014 Interconnect 5: Meshes.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 2: January 21, 2015 Heterogeneous Multicontext Computing Array Work Preclass.
CBSSS 2002: DeHon Costs André DeHon Wednesday, June 19, 2002.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day11: October 30, 2000 Interconnect Requirements.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 7: January 24, 2003 Instruction Space.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 18: February 18, 2005 Interconnect 6: MoT.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 6: January 23, 2002 Partitioning (Intro, KLFM)
Caltech CS184b Winter DeHon 1 CS184b: Computer Architecture [Single Threaded Architecture: abstractions, quantification, and optimizations] Day9:
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 7: February 3, 2002 Retiming.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 14: February 10, 2003 Interconnect 4: Switching.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.
CBSSS 2002: DeHon Interconnect André DeHon Thursday, June 20, 2002.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 16: February 14, 2003 Interconnect 6: MoT.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 18: April 2, 2014 Interconnect 4: Switching.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 16: February 14, 2005 Interconnect 4: Switching.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 6: January 19, 2005 VLSI Scaling.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 9: February 9, 2004 Partitioning (Intro, KLFM)
CALTECH CS137 Spring DeHon 1 CS137: Electronic Design Automation Day 5: April 12, 2004 Covering and Retiming.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 13: February 6, 2003 Interconnect 3: Richness.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 8: January 27, 2003 Empirical Cost Comparisons.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 6: January 22, 2003 VLSI Scaling.
Caltech CS184 Winter DeHon CS184a: Computer Architecture (Structure and Organization) Day 4: January 15, 2003 Memories, ALUs, Virtualization.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 11: January 31, 2005 Compute 1: LUTs.
CBSSS 2002: DeHon Universal Programming Organization André DeHon Tuesday, June 18, 2002.
ESE Spring DeHon 1 ESE534: Computer Organization Day 18: March 26, 2012 Interconnect 5: Meshes (and MoT)
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day14: November 10, 2000 Switching.
ESE Spring DeHon 1 ESE534: Computer Organization Day 20: April 9, 2014 Interconnect 6: Direct Drive, MoT.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 17: March 29, 2010 Interconnect 2: Wiring Requirements and Implications.
CALTECH CS137 Fall DeHon 1 CS137: Electronic Design Automation Day 21: November 28, 2005 Routing 1.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 10: January 28, 2005 Empirical Comparisons.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day12: November 1, 2000 Interconnect Requirements and Richness.
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE534 Computer Organization
CS184a: Computer Architecture (Structure and Organization)
CS137: Electronic Design Automation
CS137: Electronic Design Automation
CS137: Electronic Design Automation
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
CS184a: Computer Architecture (Structures and Organization)
CS184a: Computer Architecture (Structures and Organization)
ESE534: Computer Organization
CS184a: Computer Architecture (Structure and Organization)
CS137: Electronic Design Automation
Presentation transcript:

Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 12: February 5, 2003 Interconnect 2: Wiring Requirements and Implications

Caltech CS184 Winter DeHon 2 Previously Need for Interconnect Why simplest things don’t work –Bus –Crossbar Need to understand/exploit structure in our interconnect problem

Caltech CS184 Winter DeHon 3 Today Wiring Requirements Rent’s Rule –A model of structure Implications

Caltech CS184 Winter DeHon 4 Wires and VLSI Simple VLSI model –Have a small, finite number of wiring layers E.g. –one for horizontal wiring –one for vertical wiring –Assume wires can run over gates nand2 –Gates have fixed size (A gate ) –Wires have finite spacing (W wire )

Caltech CS184 Winter DeHon 5 Visually: Wires and VLSI or2 inv or2xnor2nor2 nand2xor2 invand2

Caltech CS184 Winter DeHon 6 Important Consequence A set of wires W = 7 W wire take up space: W = (N x W wire ) / N layers crossing a line

Caltech CS184 Winter DeHon 7 Thompson’s Argument The minimum area of a VLSI component is bounded by the larger of: –The area to hold all the gates A chip  N  A gate –The area required by the wiring A chip  N horizontal W wire  N vertical W wire

Caltech CS184 Winter DeHon 8 How many wires? We can get a lower bound on the total number of horizontal (vertical) wires by considering the bisection of the computational graph: –Cut the graph of gates in half –Minimize connections between halves –Count number of connections in cut –Gives a lower bound on number of wires

Caltech CS184 Winter DeHon 9 Bisection Width 3

Caltech CS184 Winter DeHon 10 Next Question In general, if we: –Cut design in half –Minimizing cut wires How many wires will be in the bisection? N/2 cutsize

Caltech CS184 Winter DeHon 11 Arbitrary Graph Graph with N nodes Cut in half –N/2 gates on each side Worst-case: –Every gate output on each side –Is used somewhere on other side –Cut contains N wires

Caltech CS184 Winter DeHon 12 Arbitrary Graph For a random graph –Something proportional to this is likely That is: –Given a random graph with N nodes –The number of wires in the bisection is likely to be: c  N

Caltech CS184 Winter DeHon 13 Particular Computational Graphs Some important computations have exactly this property –FFT (Fast Fourier Transform) –Sorting

Caltech CS184 Winter DeHon 14 FFT

Caltech CS184 Winter DeHon 15 FFT Can implement with N/2 nodes –Group row together Any bisection will cut N/2 wire bundles –True for any reordering

Caltech CS184 Winter DeHon 16 Assembling what we know A chip  N  A gate A chip  N horizontal W wire  N vertical W wire N horizontal = c  N N vertical = c  N –[bound true recursively in graph] A chip  cN W wire  cN W wire

Caltech CS184 Winter DeHon 17 Assembling … A chip  N  A gate A chip  cN W wire  cN W wire A chip  (cN W wire ) 2 A chip  N 2  c

Caltech CS184 Winter DeHon 18 Result A chip  N  A gate A chip  N 2  c Wire area grows faster than gate area Wire area grows with the square of gate area For sufficiently large N, –Wire area dominates gate area

Caltech CS184 Winter DeHon 19 Intuitive Version Consider a region of a chip Gate capacity in the region goes as area (s 2 ) Wiring capacity into region goes as perimeter (4s) Perimeter grows more slowly than area –Wire capacity saturates before gate

Caltech CS184 Winter DeHon 20 Result A chip  N 2  c Wire area grows with the square of gate area Troubling: –To double the size of our computation –Must quadruple the size of our chip!

Caltech CS184 Winter DeHon 21 So what? What do we do with this observation?

Caltech CS184 Winter DeHon 22 First Observation Not all designs have this large of a bisection What is typical?

Caltech CS184 Winter DeHon 23 Array Multiplier Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy bit Mpy Bit Mpy bit Bisection Width Sqrt(N)

Caltech CS184 Winter DeHon 24 Shift Register reg Bisection Width 1 Regardless of size

Caltech CS184 Winter DeHon 25 Architecture  Structure Typical architecture trick: –exploit expected problem structure What structure do we have? Impact on resources required?

Caltech CS184 Winter DeHon 26 Bisection Bandwidth Bisection bandwidth of design  lower bound on network bisection bandwidth –important, first order property of a design. –Measure to characterize Rather than assume worst case Design with more locality  lower bisection bandwidth Enough? N/2 cutsize

Caltech CS184 Winter DeHon 27 Characterizing Locality Single cut not capture locality within halves Cut again  recursive bisection

Caltech CS184 Winter DeHon 28 Regularizing Growth How do bisection bandwidths shrink (grow) at different levels of bisection hierarchy? Basic assumption: Geometric –1–1 –1/  –1/  2

Caltech CS184 Winter DeHon 29 Geometric Growth (F,  )-bifurcator –F bandwidth at root –geometric regression  at each level

Caltech CS184 Winter DeHon 30 Good Model? Log-log plot  straight lines represent geometric growth

Caltech CS184 Winter DeHon 31 Rent’s Rule In the world of circuit design, an empirical relationship to capture: IO = c N p 0  p  1 p – characterizes interconnect richness Typical: 0.5  p  0.7 “High-Speed” Logic p=0.67

Caltech CS184 Winter DeHon 32 Rent’s Rule In the world of circuit design, an empirical relationship to capture: IO = c N p compare (F,  )-bifurcator  = 2 p

Caltech CS184 Winter DeHon 33 Rent and Locality Rent and IO capture/quantifying locality –local consumption –local fanout

Caltech CS184 Winter DeHon 34 What tell us about design? Recursive bandwidth requirements in network

Caltech CS184 Winter DeHon 35 As a function of Bisection A chip  N  A gate A chip  N horizontal W wire  N vertical W wire N horizontal = N vertical = IO = cN p A chip  (cN) 2p If p<0.5 A chip  N If p>0.5 A chip  N 2p

Caltech CS184 Winter DeHon 36 In terms of Rent’s Rule If p<0.5, A chip  N If p>0.5, A chip  N 2p Typical designs have p>0.5  interconnect dominates

Caltech CS184 Winter DeHon 37 What tell us about design? Recursive bandwidth requirements in network –lower bound on resource requirements N.B. necessary but not sufficient condition on network design – I.e. design must also be able to use the wires

Caltech CS184 Winter DeHon 38 What tell us about design? Interconnect lengths –Intuition if p>0.5, everything cannot be nearest neighbor as p grows, so wire distances Can think of p as dimensionallity: p=1-1/d

Caltech CS184 Winter DeHon 39 What tell us about design? Interconnect lengths –IO=(n 2 ) P cross distance n –D(IO)/dn end at exactly distance n –E(l)=Integral 0 to n=  N of n*(d(IO)/dn)/n 2 assume iid sources

Caltech CS184 Winter DeHon 40 Math

Caltech CS184 Winter DeHon 41 Math continued

Caltech CS184 Winter DeHon 42 Math continued

Caltech CS184 Winter DeHon 43 Math Continued

Caltech CS184 Winter DeHon 44 What tell us about design? Interconnect lengths –IO=(n 2 ) P cross distance n –D(IO)/dn end at exactly distance n –E(l)=Integral 0 to n=  N of n*(d(IO)/dn)/n 2 assume iid sources –E(l)=  (N (p-0.5) ) p>0.5 True even with multiple metal layers.

Caltech CS184 Winter DeHon 45 Delays Logical capacities growing Wirelengths? –No locallity   –Rent’s Rule L  n (p-0.5) [p>0.5]

Caltech CS184 Winter DeHon 46 Capacity Rent: IO=C*N p p>0.5 A  C*N 2p Logical Area      A  C*N 2 2p   C*N 1 2p   C*N 2 2p   N 1 2p  N 2 2p   N 1 p  N 2 p  N 2   p) N 1 Sanity Check –p=1 –N 2  N –p~0.5 –N 2   N

Caltech CS184 Winter DeHon 47 What tell us about design? IO  N P Bisection BW  N P side length  N P –N if p<0.5 Area  N 2p p>0.5 Average Wire Length  N (p-0.5) p>0.5 N.B. 2D VLSI world has “natural” Rent of P=0.5 (area vs. perimeter)

Caltech CS184 Winter DeHon 48 Rent’s Rule Caveats Modern “systems” on a chip -- likely to contain subcomponents of varying Rent complexity Less I/O at certain “natural” boundaries System close –(Rent’s Rule apply to workstation, PC, PDA?)

Caltech CS184 Winter DeHon 49 Area/Wire Length Bad news –Area ~  (N 2p ) faster than N –Avg. Wire Length ~  (N (p-0.5) ) grows with N Can designers/CAD control p (locality) once appreciate its effects? I.e. maybe this cost changes design style/criteria so we mitigate effects?

Caltech CS184 Winter DeHon 50 What Rent didn’t tell us Bisection bandwidth purely geometrical No constraint for delay –I.e. a partition may leave critical path weaving between halves

Caltech CS184 Winter DeHon 51 Critical Path and Bisection Minimum cut may cross critical path multiple times. Minimizing long wires in critical path  increase cut size.

Caltech CS184 Winter DeHon 52 Rent Weakness Not account for path topology ? Can we define a “Temporal” Rent which takes into consideration? –Promising research topic

Caltech CS184 Winter DeHon 53 Big Ideas [MSB Ideas] Rent’s rule characterize locality Fixed wire layers:  Area growth  (N 2p )  Wire Length  (N (p-0.5) ) p>0.5  interconnect growing faster than compute elements –expect interconnect to dominate other resources