Construct a sequence of k instructions, such that data from the first k ­- 1 instructions have to be forwarded to the k’th instruction. How large can k be? Suppose in the division algorithm we use an...

Construct a sequence of k instructions, such that data from the first k ­- 1 instructions have to be forwarded to the k’th instruction. How large can k be?

Suppose in the division algorithm we use an initial lookup table with γ = or γ= 16?

1. Which parts of the machine have to be changed? Specify the changes.

2. How is the cost of the machine affected?