The expression of Exercise 10.2.2 can be executed by the sequence of instructions shown in Fig. 10.6. If we have as much parallelism as we need, how many steps are needed to execute the instructions?
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.
Fig. 10.6
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here