Penn ESE680-002 Spring2007 -- DeHon 1 FUTURE Timing seemed good However, only student to give feedback marked confusing (2 of 5 on clarity) and too fast.

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.
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 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 26: April 18, 2007 Et Cetera…
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day4: October 4, 2000 Memories, ALUs, and Virtualization.
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.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 4: January 22, 2007 Memories.
CS294-6 Reconfigurable Computing Day 3 September 1, 1998 Requirements for Computing Devices.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 23: April 9, 2007 Control.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 14: February 28, 2007 Interconnect 2: Wiring Requirements and Implications.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 5: January 24, 2007 ALUs, Virtualization…
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 13: February 4, 2005 Interconnect 1: Requirements.
February 12, 1998 Aman Sareen DPGA-Coupled Microprocessors Commodity IC’s for the Early 21st Century by Aman Sareen School of Electrical Engineering and.
ESE Spring DeHon 1 ESE534: Computer Organization Day 19: April 7, 2014 Interconnect 5: Meshes.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: March 3, 2014 Instruction Space Modeling 1.
Caltech CS184b Winter DeHon 1 CS184b: Computer Architecture [Single Threaded Architecture: abstractions, quantification, and optimizations] Day3:
Caltech CS184b Winter DeHon 1 CS184b: Computer Architecture [Single Threaded Architecture: abstractions, quantification, and optimizations] Day12:
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 9: February 24, 2014 Operator Sharing, Virtualization, Programmable Architectures.
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.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR FPGA Fabric n Elements of an FPGA fabric –Logic element –Placement –Wiring –I/O.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
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 27: November 14, 2011 Memory Core.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 5, 2010 Memory Overview.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 24: April 18, 2011 Covering and Retiming.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 7: January 24, 2003 Instruction Space.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 5: February 1, 2010 Memories.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day7: October 16, 2000 Instruction Space (computing landscape)
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day16: November 15, 2000 Retiming Structures.
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 21: April 4, 2012 Lossless Data Compression.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 5: January 17, 2003 What is required for Computation?
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.
Lecture 17: Dynamic Reconfiguration I November 10, 2004 ECE 697F Reconfigurable Computing Lecture 17 Dynamic Reconfiguration I Acknowledgement: Andre DeHon.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 11: January 31, 2005 Compute 1: LUTs.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: February 20, 2012 Instruction Space Modeling.
ESE Spring DeHon 1 ESE534: Computer Organization Day 20: April 9, 2014 Interconnect 6: Direct Drive, MoT.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 12: February 5, 2003 Interconnect 2: Wiring Requirements.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 8: February 19, 2014 Memories.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 17: March 29, 2010 Interconnect 2: Wiring Requirements and Implications.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 22: April 16, 2014 Time Multiplexing.
ESE534: Computer Organization
ESE532: System-on-a-Chip Architecture
ESE534: Computer Organization
ESE534 Computer Organization
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
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
Presentation transcript:

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 (5 of 5 on pace). VLIW, MIMD not mean anything to EE undergrads. In general, the taxonomy at the end is not the big revelation it was for UCB CS grad students

Penn ESE Spring DeHon 2 ESE (ESE534): Computer Organization Day 8: February 5, 2007 Computing Requirements and Instruction Space

Penn ESE Spring DeHon 3 Previously Fixed and Programmable Computation Area-Time-Energy Tradeoffs VLSI Scaling

Penn ESE Spring DeHon 4 Today Computing Requirements Instructions –Requirements –Taxonomy

Penn ESE Spring DeHon 5 Computing Requirements (review)

Penn ESE Spring DeHon 6 Requirements In order to build a general-purpose (programmable) computing device, we absolutely must have? –_

Penn ESE Spring DeHon 7

8 Primitive compute elements enough?

Penn ESE Spring DeHon 9

10

Penn ESE Spring DeHon 11 Compute and Interconnect

Penn ESE Spring DeHon 12 Sharing Interconnect Resources

Penn ESE Spring DeHon 13 Sharing Interconnect and Compute Resources What role are the memories playing here?

Penn ESE Spring DeHon 14 Memory block or Register File Interconnect: moves data from input to storage cell; or from storage cell to output.

Penn ESE Spring DeHon 15 What do I need to be able to use this circuit properly? (reuse it on different data?)

Penn ESE Spring DeHon 16

Penn ESE Spring DeHon 17 Requirements In order to build a general-purpose (programmable) computing device, we absolutely must have? –Compute elements –Interconnect: space –Interconnect: time (retiming) –Interconnect: external (IO) –Instructions

Penn ESE Spring DeHon 18 Instruction Taxonomy

Penn ESE Spring DeHon 19 Distinguishing feature of programmable architectures? –Instructions -- bits which tell the device how to behave Compute net0 add mem slot#6

Penn ESE Spring DeHon 20 Focus on Instructions Instruction organization has a large effect on: –size or compactness of an architecture –realm of efficient utilization for an architecture

Penn ESE Spring DeHon 21 Terminology Primitive Instruction (pinst) –Collection of bits which tell a single bit- processing element what to do –Includes: select compute operation input sources in space –(interconnect) input sources in time –(retiming) Compute net0 add mem slot#6

Penn ESE Spring DeHon 22 Computational Array Model Collection of computing elements –compute operator –local storage/retiming Interconnect Instruction

Penn ESE Spring DeHon 23 “Ideal” Instruction Control Issue a new instruction to every computational bit operator on every cycle

Penn ESE Spring DeHon 24 “Ideal” Instruction Distribution Why don’t we do this?

Penn ESE Spring DeHon 25 “Ideal” Instruction Distribution Problem: Instruction bandwidth (and storage area) quickly dominates everything else –Compute Block ~ 1M   x  –Instruction ~ 64 bits –Wire Pitch ~  –Memory bit ~  

Penn ESE Spring DeHon 26 Instruction Distribution 64x8 =512 Two instructions in 1024

Penn ESE Spring DeHon 27 Instruction Distribution Distribute from both sides = 2x

Penn ESE Spring DeHon 28 Instruction Distribution Distribute X and Y = 2x

Penn ESE Spring DeHon 29 Instruction Distribution Room to distribute 2 instructions across PE per metal layer (1024 = 2  8  64) Feed top and bottom (left and right) = 2  Two complete metal layers = 2   8 instructions / PE Side

Penn ESE Spring DeHon 30 Instruction Distribution Maximum of 8 instructions per PE side Saturate wire channels at 8  N = N  at 64 PE –beyond this: instruction distribution dominates area Instruction consumption goes with area Instruction bandwidth goes with perimeter

Penn ESE Spring DeHon 31 Instruction Distribution Beyond 64 PE, instruction bandwidth dictates PE size PE area =16K   N = N (64  8 )  PE area  4  N As we build larger arrays  processing elements become less dense

Penn ESE Spring DeHon 32 Avoid Instruction BW Saturation? How might we avoid this?

Penn ESE Spring DeHon 33 Instruction Memory Requirements Idea: put instruction memory in array Problem: Instruction memory can quickly dominate area, too –Memory Area = 64  1.2K  /instruction –PE area = 1M  + (Instructions)  80K 

Penn ESE Spring DeHon 34 Instruction Pragmatics Instruction requirements could dominate array size. Standard architecture trick: –Look for structure to exploit in “typical computations”

Penn ESE Spring DeHon 35 Typical Structure? What structure do we usually expect?

Penn ESE Spring DeHon 36 Two Extremes SIMD Array (microprocessors) –Instruction/cycle –share instruction across array of PEs –uniform operation in space –operation variance in time

Penn ESE Spring DeHon 37 Two Extremes SIMD Array (microprocessors) –Instruction/cycle –share instruction across array of PEs –uniform operation in space –operation variance in time FPGA –Instruction/PE –assume temporal locality of instructions (same) –operation variance in space –uniform operations in time

Penn ESE Spring DeHon 38 Placing Architectures What programmable architectures (organizations) are you familiar with?

Penn ESE Spring DeHon 39 Hybrids VLIW (SuperScalar) –Few pinsts/cycle –Share instruction across w bits DPGA –Small instruction store / PE

Penn ESE Spring DeHon 40 What differentiates a VLIW from a multicore? –E.g. 4-issue VLIW vs. 4 single-issue processors

Penn ESE Spring DeHon 41 Gross Parameters Instruction sharing width –SIMD width –granularity Instruction depth –Instructions stored locally per compute element pinsts per control thread –E.g. VLIW width

Penn ESE Spring DeHon 42 Architecture Instruction Taxonomy

Penn ESE Spring DeHon 43 Instruction Message Architectures fall out of: –general model too expensive –structure exists in common problems –exploit structure to reduce resource requirements Architectures can be viewed in a unified design space

Penn ESE Spring DeHon 44 Admin Instruction assignment due Wednesday Reading for today and Wed. on web Try GRW262 for André Office Hours this week

Penn ESE Spring DeHon 45 Big Ideas [MSB Ideas] Basic elements of a programmable computation –Compute –Interconnect (space and time, outside system [IO]) –Instructions Instruction resources can be significant –dominant/limiting resource

Penn ESE Spring DeHon 46 Big Ideas [MSB-1 Ideas] Two key functions of memory –retiming –instructions description of computation