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?

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?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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
In this case, every instruction receives its own data, independent of how the data for other instructions is obtained. We make advantage of a: A Multiple Data/Instruction B Multiple Iterations of Data or Instruction C Singular Data Single Inst D Singe Inst Multiple
Do you know what occurs when an instruction is rejected? A software-managed TLB would outperform a hardware- managed TLB in the following scenarios:
Do you know what occurs when an instruction is rejected? A software-managed TLB would outperform a hardware-managed TLB in the following scenarios:
A CPU takes 'x' number of clock cycles per one instruction; the Corresponding Pipelined CPU takes 2,3,4 and 1, clocks in IF, ID, PO and WB stages. To get the Speed-up 2.5, the 'x' value is
The instruction “addi” is an I-type instruction that can be executed using the Single-cycle datapath without modification. Answer the following question: (a) Give values of all control signals needed to execute this instruction on the single-cycle data. For example: addi $t2, $S2, 3.
Consider a non - pipelined processor with a clock rate of 5 gigahertz and average cycles per instruction of six. 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 4 gigahertz. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is
Multicycle execution is better than single cycle execution since it is: a. Every operation is completely carried out within a single clock cycle b. Break up operation so that each stage is executed in 1 clock cycle and allow skipping of unused stages. c. The maximum clock frequency is determined by the slowest instruction in the instruction set. d. A form of parallelism since more than one instruction is executed by the processor in any given cla
In the event an instruction is refused, what would be the result? In the following cases, a software-managed TLB is faster than a hardware-managed TLB:
Translate the following user-level instruction to a microprogram so it can be directly executed by the vertical architecture (VA) attached. 1.b Also show the opcode and register representation in hexadecimal for each finding VA instruction. B := D – BAND(C+D) if B < 0 GOTO 70;
In this classification, each instruction is executed uşing its own input data, independently of how other instructions get their data. We are using a(n): A Multiple Instruction Multiple Data. B Multiple Instruction Multiple Data. C Single Instruction Single Data. D Single Instruction Multiple Data
Assignment-04. A non-pipelined CPU has 12 general purpose registers (RO, R1, R2, . Following operation are supported: R12), .... ADD Ra, Rb, Rr Add Ra to Rb and store the result in Rr MUL Ra, Rb, Rr Multiply Ra to Rb and store the result in Rr MUL operations takes two dlock cycles, ADD takes one clock cycle. Calculate minimum number of clock cycles required to compute the value of the expression XY +XYZ + YZ The variables X,Y, Z are initially available in registers RO, R1 and R2 and contents of these registers must not be modified,