onsider a 5-stage pipeline (IF, ID, EX, MEM, WB) processor impleme ypassing/forwarding and 1-cycle branch delay slot. For the below co bserved? Assume that the loop runs a total of 1024 times. abel: Idw r8, 0(r10) ; load into r8 from MEM[0+r10] add r9, r8, r7; r9 = r8 + r7 addi r10, r10, 4; r10 = r10 + 4 addi r12, r12, 4; r12 = r12 + 4 bne r10, r11, Label; branch to Label if r10 != r11 stw r9, -4(r12); store r9 into MEM[-4+r12]
onsider a 5-stage pipeline (IF, ID, EX, MEM, WB) processor impleme ypassing/forwarding and 1-cycle branch delay slot. For the below co bserved? Assume that the loop runs a total of 1024 times. abel: Idw r8, 0(r10) ; load into r8 from MEM[0+r10] add r9, r8, r7; r9 = r8 + r7 addi r10, r10, 4; r10 = r10 + 4 addi r12, r12, 4; r12 = r12 + 4 bne r10, r11, Label; branch to Label if r10 != r11 stw r9, -4(r12); store r9 into MEM[-4+r12]
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![2. Consider a 5-stage pipeline (IF, ID, EX, MEM, WB) processor implementation that uses
bypassing/forwarding and 1-cycle branch delay slot. For the below code, how many stalls will be
observed? Assume that the loop runs a total of 1024 times.
Label: Idw r8, 0(r10) ; load into r8 from MEM[0+r10]
add r9, r8, r7; r9 = r8 + r7
addi r10, r10, 4; r10 = r10 + 4
addi r12, r12, 4; r12 = r12 + 4
bne r10, r11, Label; branch to Label if r10 != r11
stw r9, -4(r12); store r9 into MEM[-4+r12]
3. Consider the same piece of code as in Problem 2 above. Show a re-ordering of the instructions
in order to avoid/reduce stall cycles.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe8fe02c7-ed3b-4cf1-b18f-0db9f6ecbcc2%2F5ad83154-9aa4-4780-91b1-5f242885a8e2%2Fri9qmge_processed.png&w=3840&q=75)
Transcribed Image Text:2. Consider a 5-stage pipeline (IF, ID, EX, MEM, WB) processor implementation that uses
bypassing/forwarding and 1-cycle branch delay slot. For the below code, how many stalls will be
observed? Assume that the loop runs a total of 1024 times.
Label: Idw r8, 0(r10) ; load into r8 from MEM[0+r10]
add r9, r8, r7; r9 = r8 + r7
addi r10, r10, 4; r10 = r10 + 4
addi r12, r12, 4; r12 = r12 + 4
bne r10, r11, Label; branch to Label if r10 != r11
stw r9, -4(r12); store r9 into MEM[-4+r12]
3. Consider the same piece of code as in Problem 2 above. Show a re-ordering of the instructions
in order to avoid/reduce stall cycles.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education