In this exercise, we examine how pipelining affects the clock cycle time of the processor. Problems in this question assume that individual stages of the datapath have the following latencies: IF Id EX MEM WB a 250ps 350ps 150ps 300ps 200ps b 200ps 170ps 220ps 210ps 150ps Questions: 3.1. What is the clock cycle time in a pipelined and non-pipelined processor? What is the total latency of an LDUR instruction in a pipelined and non-pipelined processor? 3.3 If we can split one stage of the pipelined datapath into two new stages, each with half the latency of the original stage, which stage would you split and what is the new clock cycle time of the processor?

In this exercise, we examine how pipelining affects the clock cycle time of the processor. Problems in this question assume that individual stages of the datapath have the following latencies: IF Id EX MEM WB a 250ps 350ps 150ps 300ps 200ps b 200ps 170ps 220ps 210ps 150ps Questions: 3.1. What is the clock cycle time in a pipelined and non-pipelined processor? What is the total latency of an LDUR instruction in a pipelined and non-pipelined processor? 3.3 If we can split one stage of the pipelined datapath into two new stages, each with half the latency of the original stage, which stage would you split and what is the new clock cycle time of the processor?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

A microprocessor scans the status of an output I/O device every 20 ms. This is accom- plished by means of a timer alerting the processor every 20 ms. The interface of the device includes two ports: one for status and one for data output. How long does it take to scan and service the device given a clocking rate of 8 MHz? Assume for sim- plicity that all pertinent instruction cycles take 12 clock cycles.
What would occur if an instruction were to be disregarded? A software-managed TLB is speedier than a hardware-managed TLB in the following situations:
Examine how pipelining affects the clock cycle time of the processor. Problems in this exercise assume that individual stages of the datapath have the following latencies: Also, assume that instructions executed by the processor are broken down as follows: What is the clock cycle time in a pipelined and non-pipelined processor? What is the total latency of an LW instruction in a pipelined and non-pipelined processor? If we can split one stage of the pipelined datapath into two new stages, each with half the latency of the original stage, which stage would you split and what is the new clock cycle time of the processor? Assuming there are no stalls or hazards, what is the utilization of the data memory? Assuming there are no stalls or hazards, what is the utilization of the write-register port of the “Registers” unit? f. Instead of a single-cycle organization, we can use a multi-cycle organization where each instruction takes multiple cycles but one instruction finishes…
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?
In this exercise, we examine how pipelining affects the clock cycle time of the processor. Problems in this exercise assume that individual stages of the datapath have the following latencies: IF ID EX МЕМ WB 250 ps 350 ps 150 ps 300 ps 200 ps 5.1 What is the clock cycle time in a pipelined and non- pipelined processor? 5.2 What is the total latency of an LW instruction in a pipelined and non-pipelined processor?
In an unbalanced pipelined implementation, the time required to execute each individual instruction is same as for non-pipelined implementation. Select one: O True O False
Problems in this exercise assume that the logic blocks used to implement a processor's datapath (COD Figure 4.23) have the following latencies: Sign HMem/ Register D-Mem File 250 ps 150 ps Mux ALU Adder 25 ps 200 ps 150ps Single Register Register gate Read Setup 5 ps 30ps extend Control 50 ps 20 ps 50ps "Register read" is the time needed after the rising clock edge for the new register value to appear on the output. This value applies to the PC only. "Register setup" is the amount of time a register's data input must be stable before the rising edge of the clock. This value applies to both the PC and Register File. (a) Although the control unit as a whole requires 50 ps, it so happens that we can extract the correct value of the Reg2Loc control wire directly from the instruction. Thus, the value of this control wire is available at the same time as the instruction. Explain how we can extract this value directly from the instruction. Hints: Carefully examine the opcodes shown in COD…
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)
No forwarding is assumed - and assume no hazards are present We will run the following code on the pipeline RISC-V. Please show the values of all the control signals for all the participating instructions only in clock cycle 6. Note that the first instruction (add) is fetched in clock cycle 1. Note that the first instruction (add) is fetched in clock cycle 1 For every pipeline stage write all control signals that are produced or all control signals that are propagated from the previous stage to this one (and which instruction they correspond to), as sketched below. If for a stage and a control signal we do not have anything produced, you can write NA or ---: Fill in the table in picture 2
Question 1 A particular program expressed in a particular ISA executes 40 ALU instructions, 10 Loads, and 4 Stores. A simple, non-pipelined, implementation of that ISA takes 10 CPI for each ALU instruction, 50 CPI for each Load, and 25 CPI for each Store. How many clock cycles would the program take to execute? Question 2 For that program, ISA, and implementation described in the previous question, suppose that the clock frequency is 500MHz. How many microseconds would the program take to execute?
MIPS instructions classically take five steps: IF, ID, EX, MEM, WB. A certain MIPS pipeline has the following properties: - IF: 1 cycle - ID: 1 cycle - EX: 1 cycle for A type instructions, 2 cycles for B type instructions, 3 cycles for C type instructions. МЕМ: 1 суcle WB: 1 сycle EX stage of the pipeline has three separate datapaths, to accommodate for the various cycle counts. A-type instructions B-type instructions B-type instructions C-type C-type C-type instructions instructions instructions Run the following instruction sequences through this pipeline with and without forwarding (Assume full data hazard, meaning each instruction depends on data that was produced by the previous instruction, and assume no load/store instructions): a) AAAAAAAABBBBBBBBCCCCCCCC b) АВСАВСАВСАВСАВСАВСАВСАВС с) АСВАСВАСВАСВАСВАСВАСВАСВ
A particular program expressed in a particular ISA executes 40 ALU instructions, 10 Loads, and 4 Stores. A simple, non-pipelined, implementation of that ISA takes 10 CPI for each ALU instruction, 50 CPI for each Load, and 25 CPI for each Store. How many clock cycles would the program take to execute?