Suppose an instruction takes 6 cycles to execute in an unpipelined CPU: one cycle to fetch the instruction, one cycle todecode 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, thatinstruction still takes 6 cycles to execute, so how can we say the pipeline speeds up the execution of the program?

Actually, the answer has given below:

Suppose an instruction takes 6 cycles to execute in an unpipelined CPU: one cycle to fetch the instruction, one cycl decode the instruction, one cycle to determine the addressing mode of the operands, one cycle to fetch any operan 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?

Suppose an instruction takes 6 cycles to execute in an unpipelined CPU: one cycle to fetch the instruction, one cycl decode the instruction, one cycle to determine the addressing mode of the operands, one cycle to fetch any operan 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?

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

H.W.: Consider a hypothetical machine with two steps instruction cycle: fetch cycle and execute cycle. The characteristics of the machine is given in Figure 8 with the following explanation: The processor contains a single data register, called an accumulator (AC). • Both instructions and data are 8 bits long. • The memory is organized using 8-bit words. • The instruction format provides 2 bits for the opcode, and up to 26 = 64 words of memory can be directly addressed. Opcode Address (a) Instruction format Magnitude (b) Integer format Program counter (PC)= Address of instruction Instruction register (IR)- Instruction being executed Accumulator (AC) Temporary storage (c) Internal CPU registers -Load AC from memory Store AC to memory - Add to AC from memory (d) Partial list of opcodes Figure 8 Characteristics of a Hypothetical Machine Figure 9 illustrates a partial program execution, showing the relevant portions of memory and processor registers after the first instruction, 64H has…
Suppose the opcode of an MIPS instruction is 8 in decimal, and the rest of the machine code is 309FC88 in hexadecimal (from high-order bit to low-order bit). What is the instruction? When showing the registers, use names (e.g. $t0, $s2) instead of indices (e.g $8, $17). For branch instructions, show offset in place of label, e.g. beq $t1, $t2, 92. Answer:
Suppose we have two implementations of the same instruction set architecture. Computer A has a clock cycle time of 210 ps and a CPI of 2.2 for some programs, and computer B has a clock cycle time of 460 ps and a CPI of 1.3 for the same program. Which computer is faster for this program and by how much? Please and thank you
Give an example of one assembly instruction where the Execute and the Memory Update are idle (i.e. no operation is performed in that stage). Write the instruction in assembly code or describe it.
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
Determine the specific type of addressing mode (SMALL LETTERS only) and compute for the address/es. If applicable, determine the content of the destination after the execution of the instruction. Otherwise, NA. For physical address and content of the destination, use CAPITAL LETTERS,NO SPACE/S in between and NO need to include "H" or the unit. If the given register are fewer than required, just put zeroes in the most significant place. A -effective address B - physical address/es e.g. 19000-19001 C - is for addressing mode type, e.g. direct D - content of the destination after execution e.g. if register: AX=1234 EFFECTIVE ADDRES: PHYSICAL ADDRESS/ES: ADDRESSING MODE : CONTENT OF THE DESTINATION: if memory (lower address first): 12000=34;12001=12
The execution of an instructions includes the following stages : instruction fetch, instruction decode, register fetch, ALU operation, memory operation, and write back. The analysis is based on an implementation of the datapath and control unit of a 32-bit MIPS microarchitecture.
Assume a 5-stage pipelined CPU (IF – ID – MU- EX – WR) requires following time for different sections: Required time 15 ns Pipeline stages Fetch Unit Decode Unit 10 ns 20 ns Memory Unit Execution Unit 8 ns 15 ns Write back Unit The maximum delay required to transfer contents from one state to another is 2ns. a) Show the time steps of pipelining stages for the first 10 instructions of a program. Assume that Instruction-4 is a conditional loop instruction. If the condition is TRUE, CPU runs instructions: 7 - 9 twice. Please note that a single-port RAM is used with the system, such that CPU read only one data from RAM or save only one data to RAM at a time. Calculate the execution time for the first 10 instructions of a program as well. b) Show the time steps and calculate the execution time for above problem while a multiport RAM is used with the system.
Suppose the opcode of an MIPS instruction is 9 in decimal, and the rest of the machine code is 1F67875 in hexadecimal (from high-order bit to low-order bit). What is the instruction? When showing the registers, use names (e.g. $t0, $s2) instead of indices (e.g $8, $17). For branch instructions, show offset in place of label, e.g. beq $t1, $t2, 92.
Suppose that we are developing a new version of the AMD Barcelona proces- sor with a 4 GHz clock rate. We have added some additional instructions to the instruction set in such a way that the number of instructions has been reduced by 15% from the values shown for each benchmark in Exercise 1.12. The execution times obtained are shown in the following table. a. Name Execution Time (seconds) Reference Time (seconds) bzip2 700 9650 SPECratio 13.7 1.13.2 [10] In general, these CPI values are larger than those obtained in previous exercises for the same benchmarks. This is due mainly to the clock rate used in both cases, 3 GHz and 4 GHz. Determine whether the increase in the CPI is similar to that of the clock rate. If they are dissimilar, why?
Let us assume that we would like to design an ISA R-format instruction format for a processor. The processor has 256 registers and 64 opcodes. The R-format has four fields, the opcode and three fields for the registers. Show the instruction format and the bit allocation for each field.