3. Performance evaluation Assume for a given program, 60% of the executed instructions are arithmetic, 20% are load/store, and 20% are branch. a. Given this instruction mix and the assumption that an arithmetic instruction requires 2 cycles, a load/store instruction takes 6 cycles, and a branch instruction takes 3 cycles, compute the average CPI. b. How many cycles, on average, an arithmetic instruction should require to achieve 20% improvement in the overall performance, assuming that load/store and branch instructions are not improved at all.

3. Performance evaluation Assume for a given program, 60% of the executed instructions are arithmetic, 20% are load/store, and 20% are branch. a. Given this instruction mix and the assumption that an arithmetic instruction requires 2 cycles, a load/store instruction takes 6 cycles, and a branch instruction takes 3 cycles, compute the average CPI. b. How many cycles, on average, an arithmetic instruction should require to achieve 20% improvement in the overall performance, assuming that load/store and branch instructions are not improved at all.

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

For the same instruction being executed: add $s1, $s2, $t0 using the following delays for each block/action: Decode + Register File Read Data Memory Access Instruction Register Read ALU (all Register Mux Memory Access operations) Write 25 200 |125 150 300 25 10 But, now assume that all types of instructions have to be executed in one clock cycle, not just the 'add' instruction. What is the minimum clock cycle from the times below which will suffice as the clock cycle time to run the microprocessor at? Choose the best answer. 845 535 545 835
In the context of operating systems
Let's consider Tomasulo's algorithm. Assume load takes two cycles in execute, add takes three cycles, and a multiple takes seven cycles. Schedule the following code sequence using the instruction status, reservation station, and register status tables and indicate the total number of clock cycles used to complete the code. Show the information tables when the first add has completed and written its result. F2, 0 (x1) FO, F2, F4 F6, FO, F2 T1: fid T2: fmult.d T3: fadd.d T4: fadd.d F2, F4, F2
Program X Instruction Count = 29 x 105 Program Y Instruction Count = 18 x 105 Processor 1 Clock Rate = 3.3GHZ Execution Time 12ms Execution Time 9ms Table 1.0 Processor 2 Clock Rate = 2.8GHZ Execution Time 16ms Execution Time 7ms Answer the following questions based on the information above. *You are required to indicate all working steps and marks will be given accordingly. (a) Calculate the instruction execution rate for BOTH processors when running BOTH programs.
1.a) Explain "Pipeline Scheduling" and "Dynamic Scheduling".1.b)Explain "Static branch prediction" and "dynamic branch prediction".1.c) Explain "Register Renaming".1.d) Explain the "Tomasulo Algorithm".
clock cycle at which the first of the instructions is fetched as clock cycle 1. Assume that if one instruction reads a register during the same clock cycle as another instruction is writing it, the new value will be read. Do not reorder the instructions. Instructions are fetched and executed exactly in the order given below, with the pipeline stalling if necessary.addi $s2, $s2, 1li $s6, 5add $s1, $s2, $s3move $s5, $s6lw $t1, 0($s5)
For sub $rd, $rs, $rtReg[rd] = Reg[rs] + Reg[rt] - Which resources (blocks) perform a useful function for the given instructions? - Use the following diagram for each instruction and trace its flow(use pen or highlighter) for the execution of that instruction. - List the units that are used for each instruction. (I mainly need help with tracing, please and thank you)
1. We wish to compare the performance of two different machines: M1 and M2. The following measurements have been made on these machines: Program Time on M1 Time on M2 1 10 seconds 5 seconds 2 3 seconds 4 seconds Which machine is faster for each program, and by how much? 2. For M1 and M2 of problem 1, the following additional measurements are made:. Find the instruction execution rate (instructions per second) for each machine when running program 1. Program Instructions executed on M1 Instructions executed on M2 1 200 x 106 160 x 106 3. For M1 and M2 of problem 1, if the clock rates are 200 MHz and 300 MHz, respectively, find the CPI for program 1 on both machines using the data provided in problems 1 and 2. 4. You are going to enhance a machine, and there are two possible improvements: either make multiply instructions run four times faster than before or make memory access instructions run two times faster than before. You…
calculate the percentage of total cycles by each class with respect to the overall total cycles. Addition used for calculating memory effective address for load and store instructions should NOT be considere
From above question, if a branch instruction is a conditional branch instruction, the branch need not be taken; if the branch is not taken, the following instructions can be overlapped. When 80% of all branch instructions are conditional branch instructions, and 50% of the conditional branch instructions are such that the branch is taken, what is the average instruction execution time?
CPI stands for clock cycles per instruction. Speedup from pipelining = (Number of pipeline stages) / (Achieved CPI ). Assume a 5-stage pipeline. Assume that CPI = 1 when there are no pipeline stalls (the ideal case). Now assume that every branch instruction causes a 3 clock cycle stall in the pipeline. Assume that for the program being executed 30% of executed instructions are branch instructions. What speedup from pipelining is achieved by this program?
Consider the execution of a program that results in the execution of 8 million instructions on a 400-MHz processor. The program consists of four major types of instructions. The instruction mix and the CPI for each instruction type are given below. What is the program execution time in the second? Instruction Type Arithmetic and logic Load/store with cache hit Branch Floating-point arithmetic operation Execution Time: sec CPI 3 4 3 9 Instruction Mix (%) 60 20 12 8