A single cycle processor has a period of 15 ns. The same processor can be designed with a multicycle pipeline implementation with a period of 5 ns. Assuming no hazards / stalls, what is the minimum number of instructions needed before any speedup is realized? How many instructions (with no stalls or hazards) would you need to execute before the multicycle implementation gives you 3x speedup relative to a single cycle processor? What is the maximum speed up this pipeline can achieve?

A single cycle processor has a period of 15 ns. The same processor can be designed with a multicycle pipeline implementation with a period of 5 ns. Assuming no hazards / stalls, what is the minimum number of instructions needed before any speedup is realized? How many instructions (with no stalls or hazards) would you need to execute before the multicycle implementation gives you 3x speedup relative to a single cycle processor? What is the maximum speed up this pipeline can achieve?

Name: A single cycle processor has a period of 15 ns. The same processor can
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: A single cycle processor has a period of 15 ns. The same processor can be designed with a multicycle pipeline implementation with a period of 5 ns.Assuming no hazards / stalls, what is the minimum number of instructions needed before any speedup is r

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

Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of 4. The same processor is upgraded to a pipelined processor with five stages, but due to the internal pipeline delay, the clock speed is reduced to 2 gigahertz. Assume there are no stalls in the pipeline. What is the speed up achieved in this pipelined processor? 5
We have a processor that has a 200ns clock period and execute instructions sequentially (i.e., no pipeline). If we design a 25-stage pipeline (assume delay of all stages are equal, i.e., 200/25= 8ns) with pipeline registers that take 2ns each, how much speedup do we get? Assume the pipeline is full.
A hypothetical processor has 9 stages of a pipeline as shown in the table below. The first row in the table below shows the pipeline stage number, second row gives the name of each stage, and third row gives the delay of each stage in Nano-seconds. The name of each stage describes the task performed by it. Each stage takes 1 cycle to execute. This processor stores all the register contents in a compressed fashion. After fetching the operands the operands are first decompressed, and before saving the results in register file, the results are first compressed. a)How many cycles are required to execute one instruction on this pipeline? b)How many cycles are required to execute 19 instructions on this pipeline? Assume that no stall cycles occur during the execution of all instructions. c) Assume that all necessary bypass/forwarding circuitry is implemented in this 9 stage pipeline. How many cycles will the pipeline stall during the execution of below given two instructions? Briefly explain…
We begin with a computer implemented in single-cycle implementation. When thestages are split by functionality, the stages do not require exactly the same amount of time. The originalmachine had a clock cycle time of 7 ns. After the stages were split, the measured times were IF, 1 ns; ID,1.5 ns; EX, 1 ns; MEM, 2 ns; and WB, 1.5 ns. The pipeline register delay is 0.1 ns. b) [15]<C.2> If there is a stall every four instructions, what is the CPI of the new machine?c) [10]<C.2> What is the speedup of the pipelined machine over the single-cycle machine?d) [10]<C.2> If the pipelined machine had an infinite number of stages, what would its speedup be overthe single-cycle machine?
A nonpipelined system takes 100ns to process a task. The same task can be processed in a five-stage pipeline with a clock cycle of 20ns. Determine the speedup ratio of the pipeline for 100 tasks. What is the theoretical speedup that could be achieved with the pipeline system over a nonpipelined system?
Consider a hypothetical single-core pipelined processor. The pipeline has 5 stages and each stage takes 1 clock cycle to execute. 5 instructions need to be executed in the processor. The first 4 of those instructions require all 5 pipeline stages. The last instruction requires only the first 4 pipeline stages. What is the minimum number of clock cycles required to execute all 5 instructions? Assume that there are no pipeline stalls. Answer: 9
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)
Suppose an instruction takes 6 cycles to execute in an unpipelined CPU: one cycle to fetch the instruction, one cycle to decode the instruction, one cycle to determine the addressing mode of the operands, one cycle to fetch any operands, one cycle to perform the ALU operation, and one cycle to store the result. In a CPU with a 6 stage pipeline, that instruction still takes 6 cycles to execute, so how can we say the pipeline speeds up the execution of the program?
One machine uses a 2 GHz clock and executes a program with 4 classes of instructions, A, B, C, D. Their respective cycles/instruction are CPIA=3, CPIB=2, CPIC=4, and CPID=2. Another machine has a faster clock of 3.2 GHz, and a different architecture, such that the same classes of instructions have CPIA=2, CPIB=2, CPIC=3, and CPID=2. Both machines execute a program where the frequency of the four classes of instructions is 30% for Class A, 20% for Class B, 10% for Class C and 40% are instructions of Class D. a. How many instructions did each of the machines execute in 10 seconds (assume no overhead)? b. If a program has 10º instructions, which machines finishes first? c. Which machine is more performant? d. Compare the MIPS of the two machines.
Yes, even if pipeline instructions take a different amount of time to execute at different times. Where can the problems with this situation be found?
In an unbalanced pipelined implementation, the time required to execute each individual instruction is same as for non-pipelined implementation. 1true 2 false
A non pipelined processor has a clock cycle of 8.0 ns to execute each instruction. If a 6-stages pipeline is implemented, with an overhead of 0.06 ns per stage, the new clock cycle should be?