Download presentation

Presentation is loading. Please wait.

Published byAllan Hudson Modified over 2 years ago

1
Reconfigurable Computing S. Reda, Brown University Reconfigurable Computing (EN2911X, Fall07) Lecture 10: RC Principles: Software (3/4) Prof. Sherief Reda Division of Engineering, Brown University http://ic.engin.brown.edu [Some examples are based on G. De Micheli textbook and lectures]

2
Reconfigurable Computing S. Reda, Brown University Behavioral synthesis Given: a sequencing graph (data/control flow graph) that is constructed from the circuit behavioral circuit specification after code optimizations a set of functional resources (multipliers, adders, …, etc) each characterized in terms of area, delay and power a set of constraint (on circuit delay, area and power) Synthesizing the output circuit consists of two stages: (1)Place operations in time (scheduling) and space (bind them to resources) (2)Determine the detailed connection of the data path the control unit

3
Reconfigurable Computing S. Reda, Brown University Scheduling (temporal assignment) Scheduling is the task of determining the start times of all operations, subject to the precedence constraints specified by the sequencing graph The latency of the sequencing graph is the difference between the start time of the sink and the start time of the source

4
Reconfigurable Computing S. Reda, Brown University Scheduling to minimize the latency read (x, y, u, dx, a); do { xl = x + dx; ul = u – (3*x*u*dx) – (3*y*dx); yl = y + u*dx; c = xl < a; x = x1; u = u; y = yl; } while (c); write(y); Consider the following differential equation integrator

5
Reconfigurable Computing S. Reda, Brown University ASAP scheduling for minimum latency Assuming all operations to have 1 unit delay, what is the latency here?

6
Reconfigurable Computing S. Reda, Brown University ASAP scheduling algorithm

7
Reconfigurable Computing S. Reda, Brown University ALAP scheduling to meet latency constraint

8
Reconfigurable Computing S. Reda, Brown University ALAP scheduling algorithm

9
Reconfigurable Computing S. Reda, Brown University Operation mobility The mobility of an operation corresponds to the difference of the start time computed between the ALAP and ASAP algorithms Mobility measure the freedom we have in scheduling an operation to meet the timing schedule

10
Reconfigurable Computing S. Reda, Brown University Resource binding (spatial assignment) Binding determines the resource type and instance assigned for each operation How many multipliers do we need here? how many ALUs (+, -, <)?

11
Reconfigurable Computing S. Reda, Brown University Resource sharing and binding Bind a resource to two operations as long as they do not execute concurrently How many instances of the multiplier and the ALU do we need now?

12
Reconfigurable Computing S. Reda, Brown University Can we do better? Can we get the same latency with less resources Resources sharing the same instance are colored with the same color. How many instances are now needed? How can we find the solution?

13
Reconfigurable Computing S. Reda, Brown University Finding the minimal number of resources for a given latency (T) using list scheduling Initialize all resource instances to 1. for t = 1 to T: For each resource type: –Calculate the slack (ALAP time – t) of each candidate operation –Schedule candidate operations with zero slack and update the number of resource instances used if needed –Schedule any candidate operations requiring no other resource instances What is the intuition behind this heuristic?

14
Reconfigurable Computing S. Reda, Brown University Scheduling and sharing necessitates a control unit that orchestrates the sequencing of operations

15
Reconfigurable Computing S. Reda, Brown University Scheduling under resource constraint Assume we just one instance of a multiplier and one instance of an ALU (+, - and ==), how can we schedule all operations? What is the latency?

16
Reconfigurable Computing S. Reda, Brown University Finding the minimal latency for a given resource constraint (C) using list scheduling Label all operations by the length of their longest path to the sink and rank them in decreasing order Repeat –For each resource type Determine the candidate operations that U can be scheduled Select a subset of U by priority such that the resource constraint usage (C) is not exceeded –Increment time What is the intuition behind this heuristic?

17
Reconfigurable Computing S. Reda, Brown University There is an inherent tradeoff between area and latency latency area (4, 6) dominated! (7, 2) (4, 4) 1 2 3 4 5 6 7 654321654321

18
Reconfigurable Computing S. Reda, Brown University Control unit example for(i=0; i<10; i=i+1) begin x = a[i] + b[i]; z = z + x; end a b x z i Control unit CMP 10 Enable + MUX 1 How many control signals are produced from the control unit? How can we design the control unit? 101001 111001. counter control bits

19
Reconfigurable Computing S. Reda, Brown University Summary So far, we covered –SW/HW partitioning –Behavioral code optimization –Behavioral synthesis techniques Next time, I give an overview of –Technology mapping –Placement and routing

Similar presentations

OK

ECE 667 - Synthesis & Verification - Lecture 2 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits Scheduling.

ECE 667 - Synthesis & Verification - Lecture 2 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits Scheduling.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on product advertising letter Ppt on cross-site scripting message turn off Ppt on multipurpose river valley projects Ppt on acute myeloid leukemia Ppt on earthquake for class 7 Ppt on non agricultural activities and pollution Ppt on chapter 12 electricity generation Ppt on atrial septal defect Ppt on thermal power plant operation Ppt on fire management