A non-pipelined processor has a clock rate of 1 GHz and an average instruction takes 9 cycles to execute. The manufacturer has decided to design a pipelined version of this processor. For this purpose, the instruction cycle has been divided into five stages with the following latencies: Stage 1 – 2.0 ns,Stage 2 – 1.5 ns, Stage 3 – 1.0 ns, Stage 4 – 2.6 ns, Stage 5 – 1.9 ns. Each stage will require an extra 0.4 ns for the buffers between the pipeline stages, including the last stage.
a) What clock cycle time will be required for the pipelined processor? What will be the corresponding clock rate?
b) What will be the execution time for a single instruction in the pipelined processor? What is the percentage increase compared to the non-pipelined processor?
c) What is the maximum throughput of the pipelined processor expressed as MIPS? What is the speedup over the non-pipelined processor?
given that clock rate = 1GHZ = 10^9 HZ means 1 clock time = 1/ 10^9 second = 1nanosecond
given that non pipelined take 9 cycle means non pipeline take 9* 1nanosecond = 9 nanoesecond to excute a instruction.
1) since there is no specific clock rate gien for pipelined processor
so clock cycle time remain same for pipeline as non pipeline
similarly clock rate is remain same for pipeline as non pipeline
so clock cycle time = 1nanoseocnd for pipeline and non pipeline both
and clock rate = 1GHZ for pipeline and non pipeline
-------------------------------------------------------------------------------------------------------------------------------------------
2)
a pipeline version of this processor has 5 stege with time = 2.0 ns, 1,5ns, 1.0ns , 2.6ns, 1.9ns
each stage require 0.4ns extra for buffer
so effective time of 5 stage = 2.4ns , 1.9ns, 1.4ns , 3ns, 2.3ns
in pipeline all stage operate in parallel so overall time to take execute 1 instruction = maximum of all 5 stage time
= max { 2.4, 1.9, 1.4, 3.0 ,2.3 } = 3nanosecond
so execution time for single instruction in pipeline processor = 3nanosecond
It is 3 times faster than non pipelined processor .so it take only 33.33% time as compared to non pipeline faster .
so it is 300% time faster than non pipelin processor .
-------------------------------------------------------------------------------------------------------
3)
speed up = time taken to execute 1 instruction in non pipeline manner / time taken to execute 1 instruction in non pipeline manner
speed up = 9/3 = 3
so speed up over the non-pipelined processor = 3
Ideally speed up = number of stage = 5
so throughput = practically achieved speed up / Ideally speed up
= 3/5 = 0.6
= 60%
the maximum throughput of the pipelined processor expressed as MIPS is 60%
A non-pipelined processor has a clock rate of 1 GHz and an average instruction takes 9...
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: [17pts] 3. IF ID EEX MEM | WB 250ps 350ps 150ps300ps200ps a. what is the clock cycle time in a pipelined and non-pipelined (ie, single cycle) processor? what is the total latency of one lw instruction in a pipelined and non-pipelined (i.e., single cycle) processor? b. What is the total...
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 | MEMIwB 200ps 400ps 150ps 250ps 200ps Also, assume that instructions executed by the processor are broken down as follows: alu beqIwSW 45% 20% 20% 15% 3.1 What is the clock cycle time in a pipelined and non-pipelined processor? 3.2 What is the total latency...
A processor is designed such that the clock of the processor runs at 1 GHz. The following table gives the instruction frequencies for the benchmark and how many cycles each instruction takes. Instruction Type Frequency Cycles Load & Stores 25% 10 cycles Arithmetic Instructions 65% 6 cycles Branch instructions 10% 4 cycles (a) Calculate the CPI for the above benchmark. (b) Suppose the amount of registers are doubled, such that clock cycle time increases by 40%. What is the new...
(Pipelining 20%) The 5 stages of a processor have the following latencies: Fetch Decode Execute Memory Write-back 250 350ps 300ps 500ps 80ps a. If the processor is non-pipelined: what is the clock cycle time for the processor? What is the latency of an R-type instruction in the processor? b. If the processor is pipelined: What is the clock cycle time for the processor? What is the latency of an R-type instruction in the processor? C. If you could split one...
The latencies of individual stages in five-stage MIPS (Microprocessor without Interlocked Pipeline Stages) Architecture are given below. Instruction Instruction Fetch Register Read Arithmetic Logic Unit (ALU) Memory Access Register Write Latency 200ps 100ps 200ps 300ps 100ps a. (10 pts) What is the clock cycle time in a pipelined and non-pipelined processor? Pipelined version : ______________ Non-pipelined version : ______________ b. The classic five-stage pipeline MIPS architecture is used to execute the code fragments. Assume the followings: Register write is done...
01. The logic latencies for individual stages in a processor are listed in the following table. IF ID EXE MEM WB 350 ps 400 ps|370 ps450 ns 200 ps (a) What is the minimum clock period for a pipelined and a non- pipelined processor using these parameters? Please show all work. (b) What is total latency of a MIPS lw instruction in a pipelined processor? What is the throughput of a large series of lw instructions with no stalls or...
Given 3 different instruction types, A, B and C. Each type-A, B and C instruction takes 30ns, 20ns and 50ns to complete, respectively. An assembly program is written with 20 type-A, 30 type-B and 40 type-C instructions. Assume a single-issue not pipelined processor, how much time (in nano-seconds) is required to complete the execution of this program? Now let us pipeline these instructions based on a cycle time of 10ns. To pipeline these instructions equally and ideally using this cycle...
1.We have a single stage, non-pipelined machine and a pipelined machine with 5 pipeline stages. The cycle time of the former is 5 ns and the latter is 1ns. Assuming no stalls, what is the speedup of the pipelined machine over the single stage machine? 2.We have prediction schemes: not taken, predict taken and dynamic prediction. Which of these prediction would be best if we have no penalty on right, 2 cycles on wrong, average 90% accuracy and 95% frequency
1. Assume that individual stages of the datapath have the following latencies: IF ID EX MEM WB 250 ps 350 ps 150 ps 300 ps 200 ps Also, assume that instructions executed by the processor are broken down as follows: alu beq lw sw 45% 20% 20% 15% What is the total latency of an ?w instruction in a pipelined and non-pipelined processor? Instead of a single-cycle organization, we can use a multi-cycle organization where each instruction takes multiple cycles...
4.10 In this exercise, we examine how resource hazards, control hazards, and Instruction Set Architecture (ISA) design can affect pipelined execution. Problems in this exercise refer to the following fragment of MIPS code: sw r16,12(r6) lw r16,8(r6) beq r5,r4,Label # Assume r5!=r4 add r5,r1,r4 slt r5,r15,r4 Assume that individual pipeline stages have the following latencies: (NOTE THESE ARE DIFFERENT VALUES THAN THE ONES IN OTHER SIMILAR QUESTIONS) IF ID EX MEM WB 250ps 100ps 175ps 150ps 200ps 4.10.4 [10] <§4.5>...