2. Assume following sequence of instructions. Assume R-type, LVw, sw, branch, arithmetic immediate and jump instructions take 6, 8, 6, 7, 5 and 7 ns respectively. What will be the total execution time if you are running those instructions into a single-cycle datapath design? Draw flow/path of executions. SUB $50, Șto, Șt1 LW $s1, 40($s3) ADD $s2, $t2, Șto ADDI $4, St3, 175 BNE $55, Ss6, 1 sw $1, 44($s3) J 1000 In multi-stage pipeline (MIPS) if the stages take 2, 1, 2, 2, 1 ns respectively, what will be the total execution time for above code statements/generated instructions? Draw flow/path of executions. (assume forwarding is not implemented)

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
2. Assume following sequence of instructions. Assume R-type, LW, Sw, branch, arithmetic
immediate and jump instructions take 6, 8, 6, 7, 5 and 7 ns respectively. What will be the total
execution time if you are running those instructions into a single-cycle datapath design? Draw
flow/path of executions.
SUB $s0, Șto, Șt1
LW $1, 40($s3)
ADD $s2, $t2, $to
ADDI $4, St3, 175
BNE $5, $56, 1
sw $s1, 44($s3)
J 1000
In multi-stage pipeline (MIPS) if the stages take 2, 1, 2, 2, 1 ns respectively, what will be the
total execution time for above code statements/generated instructions? Draw flow/path of
executions. (assume forwarding is not implemented)
Transcribed Image Text:2. Assume following sequence of instructions. Assume R-type, LW, Sw, branch, arithmetic immediate and jump instructions take 6, 8, 6, 7, 5 and 7 ns respectively. What will be the total execution time if you are running those instructions into a single-cycle datapath design? Draw flow/path of executions. SUB $s0, Șto, Șt1 LW $1, 40($s3) ADD $s2, $t2, $to ADDI $4, St3, 175 BNE $5, $56, 1 sw $s1, 44($s3) J 1000 In multi-stage pipeline (MIPS) if the stages take 2, 1, 2, 2, 1 ns respectively, what will be the total execution time for above code statements/generated instructions? Draw flow/path of executions. (assume forwarding is not implemented)
Expert Solution
trending now

Trending now

This is a popular 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