Suppose we have a cyclic data-dependence graph with nodes a, b, c, and d. There are edges from a to b and from c to d with label (0,1) and there are edges from b to c and from d to a with label (1,1)....

Suppose we have a cyclic data-dependence graph with nodes a, b, c, and d. There are edges from a to b and from c to d with label (0,1) and there are edges from b to c and from d to a with label (1,1). There are no other edges.

a) Draw the cyclic dependence graph.

b) Compute the table of longest simple paths among the nodes.

c) Show the lengths of the longest simple paths if the initiation interval T is 2.


d) Repeat (c) if T = 3.

e) For T = 3, what are the constraints on the relative times that each of the instructions represented by a, b, c, and d may be scheduled?