Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
How many stalls (in terms of the number of stall clock cycles) will the processor experience if it does not have any forwarding unit to reduce or eliminat pipeline stalls? (Assume that the write back step of an earlier instruction and the instruction decode step of a subsequent dependent instruction can happen in the same clock cycle). Calculate the total number of clock cycles needed to complete executing the instruction sequence. If the processor has a forwarding unit to reduce different kinds of data hazards, what would be the total number of stall cycles to execute the same instruction sequence? If the manufacturer does not upgrade the processor to have a forwarding unit, but an optimizing compiler reduces hazards by altering the instruction sequence, what will be the minimal number of stall cycles?

How many stalls (in terms of the number of stall clock cycles) will the processor experience if it does not have any forwarding unit to reduce or eliminat pipeline stalls? (Assume that the write back step of an earlier instruction and the instruction decode step of a subsequent dependent instruction can happen in the same clock cycle). Calculate the total number of clock cycles needed to complete executing the instruction sequence. If the processor has a forwarding unit to reduce different kinds of data hazards, what would be the total number of stall cycles to execute the same instruction sequence? If the manufacturer does not upgrade the processor to have a forwarding unit, but an optimizing compiler reduces hazards by altering the instruction sequence, what will be the minimal number of stall cycles?

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Assume a pipelined processor with five pipeline stages where each stage takes one clock cycle. Further, assume that the processor has to execute the following instruction sequence ADD ST0, ST1, ST3 ADDI $51, $si, 4 LW $se, e($s1) SUB $55, $se, STe AND ST3, ST4, $55 SW $55, 0($s1) MULT $52, $S6, $T3 SUB ST6, ST7, $6 How many stalls (in terms of the number of stall clock cycles) will the processor experience if it does not have any forwarding unit to reduce or eliminate pipeline stalls? (Assume that the write back step of an earlier instruction and the instruction decode step of a subsequent dependent instruction can happen in the same clock cycle). Calculate the total number of clock cycles needed to complete executing the instruction sequence. If the processor has a forwarding unit to reduce different kinds of data hazards, what would be the total number of stall cycles to execute the same instruction sequence? If the manufacturer does not upgrade the processor to have a forwarding unit, but an optimizing compiler reduces hazards by altering the instruction sequence, what will be the minimal number of stall cycles?
Transcribed Image Text:Assume a pipelined processor with five pipeline stages where each stage takes one clock cycle. Further, assume that the processor has to execute the following instruction sequence ADD ST0, ST1, ST3 ADDI $51, $si, 4 LW $se, e($s1) SUB $55, $se, STe AND ST3, ST4, $55 SW $55, 0($s1) MULT $52, $S6, $T3 SUB ST6, ST7, $6 How many stalls (in terms of the number of stall clock cycles) will the processor experience if it does not have any forwarding unit to reduce or eliminate pipeline stalls? (Assume that the write back step of an earlier instruction and the instruction decode step of a subsequent dependent instruction can happen in the same clock cycle). Calculate the total number of clock cycles needed to complete executing the instruction sequence. If the processor has a forwarding unit to reduce different kinds of data hazards, what would be the total number of stall cycles to execute the same instruction sequence? If the manufacturer does not upgrade the processor to have a forwarding unit, but an optimizing compiler reduces hazards by altering the instruction sequence, what will be the minimal number of stall cycles?
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS