Scheduling (Cont.)Square Root Example

1

2

3 5 7 9

4 6 8 10

4 6 8 10

sh

Y

T

I

X

0

c

1

+ * /

+1 =0

fork

join

Separating the resources required by the

control mechanism from those for the data

manipulations:

[McFarland90]

Previous slide

Next slide

Back to first slide

View graphic version

This schedule provides maximal parallelism, observing only the essential dependencies required by the data flow graph and the loop boundaries

Two dummy nodes are used to denote loop boundaries. Note that the shift operation again does not incur any delay.

Total of 10 control steps.