Consider a datapath with 6 stages. Operation times/delays associated with each of these 6 stages are shown below: Register Write Back Instruction Instruction Execute 1 Execute 2 Data Access Fetch 200 ps Decode 100 ps 150 ps 150 ps 200 ps 100 ps Answer the following questions: a) What is the shortest possible clock period for single-cycle, non-pipelined implementation? What is the shortest possible clock period for pipelined implementation? How long will it take to execute 5 instructions on single-cycle, non-pipelined implementation? b) c)

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...
icon
Related questions
Question
Consider a datapath with 6 stages. Operation times/delays associated with each of these 6 stages
are shown below:
Register
Write Back
Instruction
Instruction
Execute 1
Execute 2
Data Access
Fetch
200 ps
Decode
100 ps
150 ps
150 ps
200 ps
100 ps
Answer the following questions:
a)
What is the shortest possible clock period for single-cycle, non-pipelined
implementation?
What is the shortest possible clock period for pipelined implementation?
How long will it take to execute 5 instructions on single-cycle, non-pipelined
implementation?
How long will it take to execute 5 instructions on pipelined implementation? Assume
that no pipeline hazards are encountered while executing these 5 instructions.
How long will it take to execute 5 instructions on pipelined implementation? Assume
that there are 2 pipeline stalls (due to hazards) while executing these 5 instructions.
b)
c)
d)
e)
Transcribed Image Text:Consider a datapath with 6 stages. Operation times/delays associated with each of these 6 stages are shown below: Register Write Back Instruction Instruction Execute 1 Execute 2 Data Access Fetch 200 ps Decode 100 ps 150 ps 150 ps 200 ps 100 ps Answer the following questions: a) What is the shortest possible clock period for single-cycle, non-pipelined implementation? What is the shortest possible clock period for pipelined implementation? How long will it take to execute 5 instructions on single-cycle, non-pipelined implementation? How long will it take to execute 5 instructions on pipelined implementation? Assume that no pipeline hazards are encountered while executing these 5 instructions. How long will it take to execute 5 instructions on pipelined implementation? Assume that there are 2 pipeline stalls (due to hazards) while executing these 5 instructions. b) c) d) e)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

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