Question 2. Recall that the clock cycle time in a non-pipelined processor is determined by the instruction (considering all stages) that takes the longest time to execute as no instruction can take more than one cycle. In a pipelined datapath, the cycle time is determined by the individual stage that takes the longest time as each cycle will execute exactly one stage. Now assume the distribution of time required by independent stages are as follows: IF 250 ID 350 EX 150 MEM 300 WB 200 Now answer the following questions: a) What should be the clock cycle time for a non-pipelined and a pipelined processor? Provide justification for your answer. b) How long will it take to execute the lw instruction in a non-pipelined processor? Why? c) How long will it take to execute the lw instruction in a pipelined processor? Why?

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
icon
Related questions
Question
Question 2. Recall that the clock cycle time in a non-pipelined processor is
determined by the instruction (considering all stages) that takes the longest time
to execute as no instruction can take more than one cycle. In a pipelined datapath,
the cycle time is determined by the individual stage that takes the longest time
as each cycle will execute exactly one stage. Now assume the distribution of time
required by independent stages are as follows:
IF
250
ID
350
EX
150
MEM
300
WB
200
Now answer the following questions:
a) What should be the clock cycle time for a non-pipelined and a pipelined
processor? Provide justification for your answer.
b) How long will it take to execute the lw instruction in a non-pipelined
processor? Why?
c) How long will it take to execute the lw instruction in a pipelined
processor? Why?
Transcribed Image Text:Question 2. Recall that the clock cycle time in a non-pipelined processor is determined by the instruction (considering all stages) that takes the longest time to execute as no instruction can take more than one cycle. In a pipelined datapath, the cycle time is determined by the individual stage that takes the longest time as each cycle will execute exactly one stage. Now assume the distribution of time required by independent stages are as follows: IF 250 ID 350 EX 150 MEM 300 WB 200 Now answer the following questions: a) What should be the clock cycle time for a non-pipelined and a pipelined processor? Provide justification for your answer. b) How long will it take to execute the lw instruction in a non-pipelined processor? Why? c) How long will it take to execute the lw instruction in a pipelined processor? Why?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
ALU instructions
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education