Derive a constrained schedule for the routine of Exercise 9.7 and hence design a data path implementation of this part of the system, assuming that one multiplier, one divider and one subtracter are available.
Exercise 9.7
The following sequence of operations is part of a cube root solution routine:
Convert this sequence to single assignment form and hence construct a data dependency graph. Assuming that each arithmetic operation takes exactly one clock cycle, derive an unconstrained as late as possible (ALAP) schedule.