PhD PRILIMS

🗞️ PhD PRILIMS 🗞️ , THE REGISTER - LEVEL MACHINE CODE FOR MAXIMUM POSSIBLE PARALLELISM

Price :

From USD 89898989898989.00

Quantity:

Enquire Now 💻

Description

Evaluate the expression { ( u + v ) + ( w + x )} +( y + z ). exactly as parenthesized ( that is do not use the commutative or associative laws to re order the addition ) . Give register lavel machine code to provide the maximum possible PARALLELISM .

1) LD R 1 , u // R 1 = u

2) LD R 2 , v // R 2 = v

3) ADD R 1 , R 1 , R 2 // R 1 = R 1 + R 2

4) LD R 2 , w // R 2 = w

5) LD R 3 , x // R 3 = x

6) ADD R 2 , R 2 , R 3 // R 2 = R 2 + R 3

7) ADD R1 , R1 , R2 // R 1 = R 1 + R 2

8) LD R 2 , y // R 2 = y

9) LD R 3 , z // R 3 = z

10) ADD R 2 , R 2 , R 3 // R 2 = R 2 + R 3

11) ADD R 1 , R 1 , R 2 // R 1 = R 1 + R 2

MACHINE CODE FOR THE ARITHMETIC EXPRESSION { ( u + v ) + ( w + x )} +( y + z )

Below a parallel computation for the same evolution , in which the expression could be evaluated in 4 steps on the 11 steps side .

Total steps in minimal register allocation/implementation = 11

Total steps using maximal PARALLELISM = 5

Thus the no. of steps saved = 6

1) R 1 = u	*R 2 = v*	*R 3 = w*	*R 4 = x*	*R 5 = y*	*R 6 = z*
*2) R 7 = R1 + R 2*	*R 8 = R 3 + R 4*	*R 9 = R 5 + R 6*
*3) R 10 = R 7 + R 8*
*4) R 11 = R 10 + R 9*