ADD R3 = R4 + R9; I4: lw $R1,0($R3) //LDW R1 = MEM[R3 + 0]; I5: sub $R3,$R1,$R4 //SUB R3 = R1 -
Consider the following assembly language code:
I0: add $R4,$R1,$R0 //ADD R4 = R1 + R0;
I1: lw $R1,100($R3) //LDW R1 = MEM[R3 + 100];
I2: lw $R9,4,($R1) // LDW R9 = MEM[R1 + 4];
I3: add $R3,$R4,$R9 //ADD R3 = R4 + R9;
I4: lw $R1,0($R3) //LDW R1 = MEM[R3 + 0];
I5: sub $R3,$R1,$R4 //SUB R3 = R1 - R4;
I6: and $R9,$R9,$R7 //AND R9 = R9 & R7;
I7: sw $R2,100($R4) //STW MEM[R4 + 100] = R2;
I8: and $R4,$R2,$R1 //AND R4 = R2 & R1;
I9: add $R1,$R5,$R4 //ADD R1 = R5 + R4;
Assume that the code runs in a pipeline with the same five stages, but the forwarding
There is a total of ____ cycles
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)