Penn ESE534 Spring 2012 -- DeHon 1 ESE534: Computer Organization Day 11: February 20, 2012 Instruction Space Modeling.

Slides:



Advertisements
Similar presentations
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 14: March 19, 2014 Compute 2: Cascades, ALUs, PLAs.
Advertisements

Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day6: October 11, 2000 Instruction Taxonomy VLSI Scaling.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day17: November 20, 2000 Time Multiplexing.
Reconfigurable Computing: What, Why, and Implications for Design Automation André DeHon and John Wawrzynek June 23, 1999 BRASS Project University of California.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day20: November 29, 2000 Review.
CS294-6 Reconfigurable Computing Day 5 September 8, 1998 Comparing Computing Devices.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 21: April 2, 2007 Time Multiplexing.
CS294-6 Reconfigurable Computing Day 6 September 10, 1998 Comparing Computing Devices.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 15: March 12, 2007 Interconnect 3: Richness.
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.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 9: February 7, 2007 Instruction Space Modeling.
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 26: April 18, 2007 Et Cetera…
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 4: January 22, 2007 Memories.
Trends toward Spatial Computing Architectures Dr. André DeHon BRASS Project University of California at Berkeley.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 10: February 12, 2007 Empirical Comparisons.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 23: April 9, 2007 Control.
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 5: January 24, 2007 ALUs, Virtualization…
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 12: February 21, 2007 Compute 2: Cascades, ALUs, PLAs.
Octavo: An FPGA-Centric Processor Architecture Charles Eric LaForest J. Gregory Steffan ECE, University of Toronto FPGA 2012, February 24.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: March 3, 2014 Instruction Space Modeling 1.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 9: February 24, 2014 Operator Sharing, Virtualization, Programmable Architectures.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 7: February 6, 2012 Memories.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 5, 2010 Memory Overview.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 7: January 24, 2003 Instruction Space.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 26: October 31, 2014 Synchronous Circuits.
Penn ESE534 Spring DeHon ESE534: Computer Organization Day 15: March 24, 2014 Empirical Comparisons.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day18: November 22, 2000 Control.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 5: February 1, 2010 Memories.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 2: January 20, 2010 Universality, Gates, Logic Work Preclass Exercise.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day7: October 16, 2000 Instruction Space (computing landscape)
CALTECH cs184c Spring DeHon CS184c: Computer Architecture [Parallel and Multithreaded] Day 11: May10, 2001 Data Parallel (SIMD, SPMD, Vector)
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 28: November 7, 2014 Memory Overview.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 2: January 18, 2012 Universality, Gates, Logic Work Preclass Exercise.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 8: January 27, 2003 Empirical Cost Comparisons.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 21: April 4, 2012 Lossless Data Compression.
Penn ESE534 Spring DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 28: November 8, 2013 Memory Overview.
Penn ESE534 Spring DeHon 1 ESE534 Computer Organization Day 9: February 13, 2012 Interconnect Introduction.
Caltech CS184 Winter DeHon CS184a: Computer Architecture (Structure and Organization) Day 4: January 15, 2003 Memories, ALUs, Virtualization.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 5, 2012 Synchronous Circuits.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 11: January 31, 2005 Compute 1: LUTs.
Penn ESE534 Spring DeHon ESE534: Computer Organization Day 14: March 12, 2012 Empirical Comparisons.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 8: February 19, 2014 Memories.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 22: April 16, 2014 Time Multiplexing.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 10: January 28, 2005 Empirical Comparisons.
ESE532: System-on-a-Chip Architecture
ESE534: Computer Organization
ESE532: System-on-a-Chip Architecture
ESE532: System-on-a-Chip Architecture
CS184a: Computer Architecture (Structure and Organization)
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
Characteristics of Reconfigurable Hardware
ESE534: Computer Organization
CS184a: Computer Architecture (Structure and Organization)
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
ESE532: System-on-a-Chip Architecture
ESE532: System-on-a-Chip Architecture
Presentation transcript:

Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: February 20, 2012 Instruction Space Modeling

Penn ESE534 Spring DeHon 2 Last Time Instruction Requirements Instruction Space

Architecture Taxonomy Penn ESE534 Spring DeHon 3 PCsPints/PCdepthwidthArchitecture 0N11FPGA 1N (48,640)81Tabula ABAX (A1EC04) Scalar Processor (RISC) 1NDWVLIW (superscalar) 11SmallW*NSIMD, GPU, Vector N1DWMIMD 161 (4?) core

Penn ESE534 Spring DeHon 4 Today Model Architecture from Instruction Parameters –implied costs –gross application characteristics

Penn ESE534 Spring DeHon 5 Quotes If it can’t be expressed in figures, it is not science; it is opinion. -- Lazarus Long

Penn ESE534 Spring DeHon 6 Modeling Why do we model?

Penn ESE534 Spring DeHon 7 Motivation Need to understand –How costly is a solution Big, slow, hot, energy hungry…. –How compare to alternatives –Cost and benefit of flexibility

Penn ESE534 Spring DeHon 8 What we really want: Complete implementation of our application For each architectural alternatives –In same implementation technology –w/ multiple area-time points

Penn ESE534 Spring DeHon 9 Reality Seldom get it packaged that nicely –much work to do so –technology keeps moving We must deal with –estimation from components –technology differences –few area-time points

Penn ESE534 Spring DeHon 10 Modeling Instruction Effects Restrictions from “ideal” +save area and energy –limit usability (yield) of PE May cost more energy, area in the end… Want to understand effects –area model [today] (energy model on HW5) –utilization/yield model

Preclass Energies? –8-bit, 16-bit, 32-bit, 64-bit 16-bit on 32-bit? –Sources of inefficiency? 8-bit operations per 64-bit operation? 64-bit on 8-bit? –Sources of inefficiency? Penn ESE534 Spring DeHon 11

Efficiency/Yield Intuition What happens when –Datapath is too wide? –Datapath is too narrow? –Instruction memory is too deep? Penn ESE534 Spring DeHon 12

Efficiency/Yield Intuition What happens when –Datapath is too wide? –Datapath is too narrow? –Instruction memory is too deep? –Instruction memory is too shallow? Penn ESE534 Spring DeHon 13

Penn ESE534 Spring DeHon 14 Computing Device Composition –Bit Processing elements –Interconnect: space –Interconnect: time –Instruction Memory Tile together to build device

Penn ESE534 Spring DeHon 15 Computing Device

Penn ESE534 Spring DeHon 16 Computing Device Composition –Bit Processing elements –Interconnect: space –Interconnect: time –Instruction Memory Tile together to build device

Penn ESE534 Spring DeHon 17 Relative Sizes Bit Operator 3-5KF 2 Bit Operator Interconnect 200K-250KF 2 Instruction (w/ interconnect) 20KF 2 Memory bit (SRAM) F 2

Penn ESE534 Spring DeHon 18 Model Area

Penn ESE534 Spring DeHon 19 Architectures Fall in Space

Penn ESE534 Spring DeHon 20 Calibrate Model

Penn ESE534 Spring DeHon 21 Peak Densities from Model

Penn ESE534 Spring DeHon 22 Peak Densities from Model Only 2 of 4 parameters –small slice of space –100  density across Large difference in peak densities –large design space!

Penn ESE534 Spring DeHon 23 Architectural parameters  Peak Densities

Penn ESE534 Spring DeHon 24 Efficiency What do we really want to maximize? –Not peak, “guaranteed not to exceed” performance, but… –Useful work per unit silicon [per Joule] Yield Fraction / Area (or minimize (Area/Yielded performance) )

Penn ESE534 Spring DeHon 25 Efficiency For comparison, look at relative efficiency to ideal. Ideal = architecture exactly matched to application requirements Efficiency = A ideal /A arch A arch = Area Op/Yield

Penn ESE534 Spring DeHon 26 Width Mismatch Efficiency Calculation

Penn ESE534 Spring DeHon 27 Efficiency: Width Mismatch c=1, 16K PEs

Efficiency for Preclass Preclass 6 table Penn ESE534 Spring DeHon 28

Application vs. Architecture W task vs. W arch Path Length vs. Context Depth Penn ESE534 Spring DeHon 29

Penn ESE534 Spring DeHon 30 Path Length How many primitive-operator delays before can perform next operation? –Reuse the resource

Penn ESE534 Spring DeHon 31 Reuse Path Length: How much sequentialization is allowed (required)? How many times can I reuse each primitive operator? E.g. Want meet 30ns real time rate with 1.5ns cycle time, can afford to issue 15 sequential ops.

Penn ESE534 Spring DeHon 32 Context (Instruction) Depth

Penn ESE534 Spring DeHon 33 Efficiency with fixed Width w=1, 16K PEs Path Length Context Depth

Penn ESE534 Spring DeHon 34 Ideal Efficiency (different model) Two resources here: active processing elements operation description/state Applications need in different proportions. Application Requirement

Robust Point What is Energy Robust Point for preclass model? Penn ESE534 Spring DeHon 35

Penn ESE534 Spring DeHon 36 Robust Point depend on Width w=1 w=8 w=64

Penn ESE534 Spring DeHon 37 Processors and FPGAs (architecture vs. two application axes) FPGA c=d=1, w=1, k=4 “Processor” c=d=1024, w=64, k=2

Application Needs What are common application datawidths? What are common application path lengths? Penn ESE534 Spring DeHon 38

Examples Penn ESE534 Spring DeHon 39 ApplicationWappLcritpathLpathNotes Conway LIFE 111Run as fast as possible Entropy Code ns memory interface Video GHz for 1024x1024 x30 frames/s Audio ,00044KHz for 1GHz FDTD351-5

Penn ESE534 Spring DeHon 40 Intermediate Architecture w=8 c=64 16K PEs Hard to be robust across entire space…

Penn ESE534 Spring DeHon 41 Caveats Model abstracts away many details that are important –interconnect (day ) –control (day 22) –specialized functional units (day 14) Applications are a heterogeneous mix of characteristics

Penn ESE534 Spring DeHon 42 Modeling Message Architecture space is huge Easy to be very inefficient Hard to pick one point robust across entire space Why we have so many architectures?

Penn ESE534 Spring DeHon 43 General Message Parameterize architectures Look at continuum –costs –benefits Often have competing effects –leads to maxima/minima

Penn ESE534 Spring DeHon 44 Admin Should now have all background for HW5 –Problem 2 similar (looking for robust point) –Different: Interconnect parameter, Energy No class Wednesday No office hours Tuesday Next class Monday –Reading online HW 6 out –1 and 2 due Friday 2/3 –Should be able to do 1 now

Penn ESE534 Spring DeHon 45 Big Ideas [MSB Ideas] Applications typically have structure Exploit this structure to reduce resource requirements Architecture is about understanding and exploiting structure and costs to reduce requirements

Penn ESE534 Spring DeHon 46 Big Ideas [MSB Ideas] Instruction organization induces a design space (taxonomy) for programmable architectures Arch. structure and application requirements mismatch  inefficiencies Model  visualize efficiency trends Architecture space is huge –can be very inefficient –need to learn to navigate