Prove that Algorithm 10.19, in the special case where every operation requires only one unit of one resource, can always find a softwarepipeline schedule meeting the lower bound.
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 h0; 1i and there are edges from b to c and from d to a with label h1; 1i. There are no other edge
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.