Repeat Exercise 10.2.2 for the following expressions: If instead of maximizing the parallelism, we minimized the number of registers, how many steps would the computation take? How many steps do we...

Repeat Exercise 10.2.2 for the following expressions:




If instead of maximizing the parallelism, we minimized the number of registers, how many steps would the computation take? How many steps do we save by using maximal parallelism?

Exercise 10.2.2

Evaluate the expression ((u+v) + (w+x)) + (y+z) exactly as parenthesized (i.e., do not use the commutative or associative laws to reorder the additions). Give register-level machine code to provide the maximum possible parallelism.