4.4 Problems in this exercise assume that logic blocks needed to implement a processor's datapath have the following latencies: I-Mem Add Mux ALU Regs D-Mem Sign-Extend Shift-Left-2 200ps 70ps 20ps 90ps 90ps 250ps 15ps 10ps 4.4.1. [10] <$4.3> If the only thing we need to do in a processor is fetch consecutive instructions (Figure 4.6), what would the cycle time be? 4.4.2 [10] <$4.3> Consider a datapath similar to the one in Figure 4.11, but for a processor that only has one type of instruction: unconditional PC-relative branch. What would the cycle time be for this datapath? 4.4.3 [10] <$4.3> Repeat 4.4.2, but this time we need to support only conditional PC-relative branches. The remaining three problems in this exercise refer to the datapath element Shift- left-2: 4.4.4 [10] <§4.3> Which kinds of instructions require this resource? 4.4.5 [20] <§4.3> For which kinds of instructions (if any) is this resource on the critical path? 4.4.6 [10] Assuming that we only support beq and add instructions, discuss how changes in the given latency of this resource affect the cycle time of the processor. Assume that the latencies of other resources do not change.

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
4.4 Problems in this exercise assume that logic blocks needed to implement a
processor's datapath have the following latencies:
I-Mem
Add
Mux
ALU
Regs
D-Mem
Sign-Extend
Shift-Left-2
200ps
70ps
20ps
-90ps
90ps
250ps
15ps
10ps
4.4.1. [10] <$4.3> If the only thing we need to do in a processor is fetch consecutive
instructions (Figure 4.6), what would the cycle time be?
4.4.2 [10] <$4.3> Consider a datapath similar to the one in Figure 4.11, but for a
processor that only has one type of instruction: unconditional PC-relative branch.
What would the cycle time be for this datapath?
4.4.3 [10] <$4.3> Repeat 4.4.2, but this time we need to support only conditional
PC-relative branches.
The remaining three problems in this exercise refer to the datapath element Shift-
left-2:
4.4.4 [10] <$4.3> Which kinds of instructions require this resource?
4.4.5 [20] <$4.3> For which kinds of instructions (if any) is this resource on the
critical path?
4.4.6 [10] <S4.3> Assuming that we only support beq and add instructions,
discuss how changes in the given latency of this resource affect the cycle time of the
processor. Assume that the latencies of other resources do not change.
Transcribed Image Text:4.4 Problems in this exercise assume that logic blocks needed to implement a processor's datapath have the following latencies: I-Mem Add Mux ALU Regs D-Mem Sign-Extend Shift-Left-2 200ps 70ps 20ps -90ps 90ps 250ps 15ps 10ps 4.4.1. [10] <$4.3> If the only thing we need to do in a processor is fetch consecutive instructions (Figure 4.6), what would the cycle time be? 4.4.2 [10] <$4.3> Consider a datapath similar to the one in Figure 4.11, but for a processor that only has one type of instruction: unconditional PC-relative branch. What would the cycle time be for this datapath? 4.4.3 [10] <$4.3> Repeat 4.4.2, but this time we need to support only conditional PC-relative branches. The remaining three problems in this exercise refer to the datapath element Shift- left-2: 4.4.4 [10] <$4.3> Which kinds of instructions require this resource? 4.4.5 [20] <$4.3> For which kinds of instructions (if any) is this resource on the critical path? 4.4.6 [10] <S4.3> Assuming that we only support beq and add instructions, discuss how changes in the given latency of this resource affect the cycle time of the processor. Assume that the latencies of other resources do not change.
5.8 Mean Time Between Failures (MTBF), Mean Time To Replacement (MTTR), and
Mean Time To Failure (MTTF) are useful metrics for evaluating the reliability and
availability of a storage resource. Explore these concepts by answering the questions
about devices with the following metrics.
MTTF
MTTR
3 Years
1 Day
5.8.1 (5] <$5.5> Calculate the MTBF for each of the devices in the table.
5.8.2 [5] <$5.5> Calculate the availability for each of the devices in the table.
5.8.3 [5] <$5.5> What happens to availability as the MTTR approaches 0? Is this a
realistic situation?
5.8.4 [5] <$5.5> What happens to availability as the MTTR gets very high, ie., a
device is difficult to repair? Does this imply the device has low availability?
4.2 The basic single-cycle MIPS implementation in Figure 4.2 can only implement
some instructions. New instructions can be added to an existing Instruction Set
Architecture (ISA), but the decision whether or not to do that depends, among
other things, on the cost and complexity the proposed addition introduces into the
processor datapath and control. The first three problems in this exercise refer to the
new instruction:
Instruction: LWI Rt, Rd(Rs)
Interpretation: Reg[Rt] -
Mem[Reg[Rd]+Reg[Rs]]
4.2.1 (10] <$4.1> Which existing blocks (if any) can be used for this instruction?
4.2.2 (10] <S4.1> Which new functional blocks (if any) do we need for this
instruction?
4.2.3 (10] <$4.1> What new signals do we need (if any) from the control unit to
support this instruction?
W
Transcribed Image Text:5.8 Mean Time Between Failures (MTBF), Mean Time To Replacement (MTTR), and Mean Time To Failure (MTTF) are useful metrics for evaluating the reliability and availability of a storage resource. Explore these concepts by answering the questions about devices with the following metrics. MTTF MTTR 3 Years 1 Day 5.8.1 (5] <$5.5> Calculate the MTBF for each of the devices in the table. 5.8.2 [5] <$5.5> Calculate the availability for each of the devices in the table. 5.8.3 [5] <$5.5> What happens to availability as the MTTR approaches 0? Is this a realistic situation? 5.8.4 [5] <$5.5> What happens to availability as the MTTR gets very high, ie., a device is difficult to repair? Does this imply the device has low availability? 4.2 The basic single-cycle MIPS implementation in Figure 4.2 can only implement some instructions. New instructions can be added to an existing Instruction Set Architecture (ISA), but the decision whether or not to do that depends, among other things, on the cost and complexity the proposed addition introduces into the processor datapath and control. The first three problems in this exercise refer to the new instruction: Instruction: LWI Rt, Rd(Rs) Interpretation: Reg[Rt] - Mem[Reg[Rd]+Reg[Rs]] 4.2.1 (10] <$4.1> Which existing blocks (if any) can be used for this instruction? 4.2.2 (10] <S4.1> Which new functional blocks (if any) do we need for this instruction? 4.2.3 (10] <$4.1> What new signals do we need (if any) from the control unit to support this instruction? W
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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