SchedulingSquare Root Example

1

2

3

4 9 14 19

5 10 15 20

6 11 16 21

7 12 17 22

8 13 18 23

mem

fu

1

2

2

3 7 11 15

4 8 12 16

4 8 12 16

5 9 13 17

6 10 14 18

fu

I

T

Y

X

0

c

c

Simple implementation

with no registers:

Using registers to hold

intermediate calculations:

[McFarland90]

Previous slide

Next slide

Back to first slide

View graphic version

The aim of scheduling is to assign operations to control steps so as to minimize a give objective function (e.g., control steps, delay, power, hardware resources).

Left side above is the straight-forward sequential approach. Total of 23 control steps.

Right side above adds registers (including the extra T register) so that the :=0 check and the shift can be done in zero time and will not need their own control steps. Total of 18 control steps.