CS294-6 Reconfigurable Computing Day 10 September 24, 1998 Interconnect Richness.

Slides:



Advertisements
Similar presentations
Types of Algorithms.
Advertisements

Algorithm Strategies Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
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 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) 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.
Penn ESE Fall DeHon 1 ESE (ESE534): Computer Organization Day 19: March 26, 2007 Retime 1: Transformations.
CS294-6 Reconfigurable Computing Day 13 October 6, 1998 Interconnect Partitioning.
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.
EDA (CS286.5b) Day 11 Scheduling (List, Force, Approximation) N.B. no class Thursday (FPGA) …
EDA (CS286.5b) Day 3 Clustering (LUT Map and Delay) N.B. no lecture Thursday.
CS294-6 Reconfigurable Computing Day 12 October 1, 1998 Interconnect Population.
CS294-6 Reconfigurable Computing Day 15 October 13, 1998 LUT Mapping.
Lecture 9: Multi-FPGA System Software October 3, 2013 ECE 636 Reconfigurable Computing Lecture 9 Multi-FPGA System Software.
CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.
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 ESE (ESE534): Computer Organization Day 14: February 28, 2007 Interconnect 2: Wiring Requirements and Implications.
Chapter 5 Data mining : A Closer Look.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 13: February 4, 2005 Interconnect 1: Requirements.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
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.
EM and expected complete log-likelihood Mixture of Experts
Dynamic Programming. Well known algorithm design techniques:. –Divide-and-conquer algorithms Another strategy for designing algorithms is dynamic programming.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 2: January 21, 2015 Heterogeneous Multicontext Computing Array Work Preclass.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day11: October 30, 2000 Interconnect Requirements.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
Georgia Institute of Technology, Microelectronics Research Center Prediction of Interconnect Fan-out Distribution Using Rent’s Rule Payman Zarkesh-Ha,
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 CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 14: February 10, 2003 Interconnect 4: Switching.
Topics Architecture of FPGA: Logic elements. Interconnect. Pins.
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 CS137 Winter DeHon CS137: Electronic Design Automation Day 3: January 12, 2004 Clustering (LUT Mapping, Delay)
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 16: February 14, 2005 Interconnect 4: Switching.
Types of Algorithms. 2 Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 9: February 9, 2004 Partitioning (Intro, KLFM)
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 13: February 6, 2003 Interconnect 3: Richness.
FPGA Logic Cluster Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
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.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day14: November 10, 2000 Switching.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 12: February 5, 2003 Interconnect 2: Wiring Requirements.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 17: March 29, 2010 Interconnect 2: Wiring Requirements and Implications.
CALTECH CS137 Winter DeHon 1 CS137: Electronic Design Automation Day 8: January 27, 2006 Cellular Placement.
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
COMPUTATIONAL MODELS.
CS184a: Computer Architecture (Structure and Organization)
CS137: Electronic Design Automation
Types of Algorithms.
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
Networked Real-Time Systems: Routing and Scheduling
Sungho Kang Yonsei University
Professor Ioana Banicescu CSE 8843
CS184a: Computer Architecture (Structures and Organization)
CS137: Electronic Design Automation
CS184a: Computer Architecture (Structure and Organization)
Presentation transcript:

CS294-6 Reconfigurable Computing Day 10 September 24, 1998 Interconnect Richness

Last Thursday Interconnect is dominant area in spatial architectures Characterize interconnect locality/richness –Bifurcators –Rent’s Rule

Today How rich should interconnect be? –Allow full utilization? –Model requirements and area impact (Remind students use microphones)

Thursday: Geometric Growth (F,  )-bifurcator –F bandwidth at root –geometric regression  at each level

Thursday: Good Model? Log-log plot ==> straight lines represent geometric growth

Rent’s Rule Long standing empirical relationship –IO = C*N P –0  P  1.0 –compare (F,  )-bifurcator  = 2 P Captures notion of locality –some signals generated and consumed locally –reconvergent fanout

Today How rich should interconnect be? –Allow full utilization? –Model requirements and area impact

Step 1: Build Architecture Model Assume geometric growth Build architecture can tune –F, C – , p

Tree of Meshes Tree Restricted internal bandwidth Can match to model

Parameterize C

Parameterize Growth (2 1)* =>  =  2 (2 2 1)* =>  =(2*2) (1/3) =2 (2/3) ( )* =>  =2 (3/4)

Step 2: Area Model Need to know effect of architecture parameters on area (costs) –focus on dominant components wires (saw on Thursday) switches logic blocks(?)

Area Parameters A logic =   A sw =   Wire Pitch = 8

Switchbox Population Full population is excessive (see next week) Hypothesis: linear population adequate –still to be (dis)proven

“Cartoon” VLSI Area Model (Example artificially small for clarity)

Larger “Cartoon” 1024 LUT Network P=0.67 LUT Area 3%

Effects of P (  ) on Area P=0.5P=0.67P= LUT Area Comparison

Effects of P on Capacity

Step 3: Characterize Application Requirements Identify representative applications. –Today: IWLS93 logic benchmarks How much structure there? How much variation among applications?

Application Requirements Max: C=7, P=0.68 Avg: C=5, P=0.72

Benchmark Wide

Benchmark Parameters

Complication Interconnect requirements vary among applications Interconnect richness has large effect on area What is effect of architecture/application mismatch? –Interconnect too rich? –Interconnect too poor?

Interconnect Mismatch in Theory

Step 4: Assess Resource Impact Map designs to parameterized architecture Identify architectural resource required

Mapping to Fixed Wire Schedule Easy if need less wires than Net If need more wires than net, must depopulate to meet interconnect limitations.

Mapping to Fixed-WS Better results if “reassociate” rather than keeping original subtrees.

Observation Don’t really want a “bisection” of LUTs –subtree filled to capacity by either of LUTs root bandwidth –May be profitable to cut at some place other than midpoint not require “balance” condition –“Bisection” should account for both LUT and wiring limitations

Challenge Not know where to cut design into –not knowing when wires will limit subtree capacity

Brute Force Solution Explore all cuts –start with all LUTs in group –consider “all” balances –try cut –recurse

Brute Force Too expensive Exponential work …viable if solving same subproblems

Simplification Single linear ordering Partitions = pick split point on ordering Reduce to finding cost of [start,end] ranges (subtrees) within linear ordering Only n 2 such subproblems Can solve with dynamic programming

Dynamic Programming Start with base set of size 1 Compute all splits of size n, from solutions to all problems of size n-1 or smaller Done when compute where to split 0,N-1

Dynamic Programming Just one possible “heuristic” solution to this problem –not optimal –dependent on ordering –sacrifices ability to reorder on splits to avoid exponential problem size Opportunity to find a better solution here...

Ordering LUTs Another problem –lay out gates in 1D line –minimize sum of squared wire length tend to cluster connected gates together –Is solvable mathematically for optimal Eigenvector of connectivity matrix Use this 1D ordering for our linear ordering

Mapping Results

Step 5: Apply Area Model Assess impact of resource results

Resources x Area Model => Area

Net Area

Picking an Optimum

What about a single design?

LUT Utilization predict Area?

Summary Interconnect area dominates logic block area Interconnect requirements vary –among designs –within a single design To minimize area –focus on using dominant resource (interconnect) –may underuse non-dominant resources (LUTs)

Methodology Architecture model (parameterized) Cost model Important task characteristics Mapping Algorithm –Map to determine resources Apply cost model Digest results –find optimum (multiple?) –understand conflicts (avoidable?)