1.14 Assume a program requires the execution of 50 x 106 FP instructions, 110 x 106 INT instructions, 80 x 106 L/S instructions, and 16 x 106 branch instructions. The CPI for each type of instruction is 1, 1, 4, and 2, respectively. Assume that the processor has a 2 GHz clock rate. 1.14.1 (10] <$1.10> By how much must we improve the CPI of FP instructions if we want the program to run two times faster? 1.14.2 (10] <$1.10> By how much must we improve the CPI of L/S instructions if we want the program to run two times faster? 1.14.3 [5] <$1.10> By how much is the execution time of the program improved if the CPI of INT and FP instructions is reduced by 40% and the CPI of L/S and Branch is reduced by 30%?

1.14 Assume a program requires the execution of 50 x 106 FP instructions, 110 x 106 INT instructions, 80 x 106 L/S instructions, and 16 x 106 branch instructions. The CPI for each type of instruction is 1, 1, 4, and 2, respectively. Assume that the processor has a 2 GHz clock rate. 1.14.1 (10] <$1.10> By how much must we improve the CPI of FP instructions if we want the program to run two times faster? 1.14.2 (10] <$1.10> By how much must we improve the CPI of L/S instructions if we want the program to run two times faster? 1.14.3 [5] <$1.10> By how much is the execution time of the program improved if the CPI of INT and FP instructions is reduced by 40% and the CPI of L/S and Branch is reduced by 30%?

Name: 1.14 Assume a program requires the execution of 50 x 106 FP instructi
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 1.14 Assume a program requires the execution of 50 x 106 FP instructions,110 x 106 INT instructions, 80 x 106 L/S instructions, and 16 x 106 branchinstructions. The CPI for each type of instruction is 1, 1, 4, and 2, respectively.Assume that the pro

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

8 A computer consists of a processor and an I/O device D connected to main memory M via a shared bus with a data bus width of one word. The processor can execute a maximum of 106 instructions per second. An average instruction requires five ma- chine cycles, three of which use the memory bus. A memory read or write operation uses one machine cycle. Suppose that the processor is continuously executing "background" programs that require 95% of its instruction execution rate but not any I/O instructions. Assume that one processor cycle equals one bus cycle. Now suppose the I/O device is to be used to transfer very large blocks of data between M and D. a. If programmed I/O is used and each one-word I/O transfer requires the processor to execute two instructions, estimate the maximum I/O data-transfer rate, in words per second, possible through D. b. Estimate the same rate if DMA is used.
Instruction class Frequency% 50 % CPI of MI CPI of M2 30 % 20% 3 4. 4. 2. Determine the average CPI for each MI and M2 b. Which machine is faster? And by how much? c. Calculate MIPS rating for MI and M2? d. Assume M1 has 8 core's CPU. The programmers reprogram p such that 90% of its source codes are fully parallelized. Determine the speedup gained when compared with the sequential version of p? Finally, determine the efficiency?
8 A computer consists of a processor and an I/O device D connected to main memory M via a shared bus with a data bus width of one word. The processor can execute a maximum of 106 instructions per second. An average instruction requires five ma- chine cycles, three of which use the memory bus. A memory read or write operation uses one machine cycle. Suppose that the processor is continuously executing "background" programs that require 95% of its instruction execution rate but not any I/O instructions. Assume that one processor cycle equals one bus cycle. Now suppose the I/O device is to be used to transfer very large blocks of data between M and D. a. If programmed I/O is used and each one-word I/O transfer requires the processor to execute two instructions, estimate the maximum I/O data-transfer rate, in words per second, possible through D. b. Estimate the same rate if DMA is used.
two different compilers are being tested on the same program for a 3.6GHz machine with three different classes of instructions: Class A,B and C, which require 1, 2 and 3 cycles respectively. the instruction count produced by the first compiler is 4 billion Class A instuctions, 1 billion class B and 4 billion class C instructions. the second compiler produces 8 billion Class A instructions, 2 billion Class B and 3 billion class C instructions. which compiler produces a higher MIPS? which compiler produces a better execution time?
A program is profiled on a CPU: 20% of all instructions are arithmetic, 40% are load, 20% are store, 20% are conditional branches. On this CPU, loads take 4 cycles, stores 1 cycle, ALU instructions 2 cycle, and branches 3 cycles. Compute the CPI for each instruction and the average CPI for that program on that CPU: Compute the CPI for each instruction (GIVE ANSWERS WITH 2 DECIMAL DIGITS: CPI for loads is CPI for stores is CPI for ALU is CPI for branches is Average CPI is
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)
4.19.16: [5] <COD §4.6>. 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: Also, assume that instructions executed by the processor are broken down as follows: (a) What is the clock cycle time in a pipelined and non-pipelined processor? (b) What is the total latency of an lw instruction in a pipelined and non-pipelined processor? (c) If we can split one stage of the pipelined datapath into two new stages, each with half the latency of the original stage, which stage would you split and what is the new clock cycle time of the processor? (d) Assuming there are no stalls or hazards, what is the utilization of the data memory? (e) Assuming there are no stalls or hazards, what is the utilization of the write-register port of the "Registers" unit? No hand written and fast answer with explanation
10. 10. Amdahl's Law is as applicable to software as it is to hardware. An oft-cited programming truism states that a program spends 90% of its time executing 10% of its code. Thus, tuning a small amount of program code can often have an enormous effect on the overall performance of a software product. Determine the overall system speedup if: 1. a) 90% of a program is made to run 10 times as fast (900% faster). 2. b) 80% of a program is made to run 20% faster.
Question 20 Consider two different machines with two different instruction sets, both of which have a clock rate of 800 MHz. The following measurements are recorded on the two machines running a given set of benchmark programs. Instruction Type Machine A Arithmetic and logic Load and store Branch Others Machine B Arithmetic and logic Load and store Branch Others O 50 ms O 70 ms O 55.2 ms O 60 ms Instruction Count (millions) O None of them 8 4 2 4 10 8 2 4 Cycles per Instruction 1 3 4 With machine A, how long would it take to execute the program? 3 1 2 4 3
i Consider two different implementations, 11 and12, of the same instruction set. There are three classes ofinstructions (A, B, and C) in the instruction set. 11 has a clockrate of 5 GHz, and 12 has a clock rate of 7 GHz. The average numberof cycles for each instruction class on 11 and 12 is given in thefollowing table: Class CPI on 11 CPI on 12 C1 Usage C2 Usage C3 Usage A 30% 25% 5% B 1 2. 40% 25% 90% 4 2 30% 50% 5% The table also contains a summary of average proportion ofinstruction classes generated by three different compilers, C1, C2,and C3. Assume that each compiler uses the same number ofinstructions for a given program but that the instruction mix is asdescribed in the table. a). Using C1, compute the average CPI for each of 1 and 12Then compute the speed, that is the average number of instructionsper second for each of 1 and 12. Then decide which one is fasterthan the other? and in what ratio? b). Using C2, compute the average CPI for each of 11 and 12Then compute the speed,…
Consider the fragment of LEGv8 assembly below: Program1 STUR X16, [X6, #12] LDUR X16, [X6, #8] SUB X7, X5, X4 CBZ X7, Label ADD X5, X1, X4 SUB X5, X15, X4 Suppose we modify the pipeline so that it has only one memory (that handles both instructions and data). In this case, there will be a structural hazard every time a program needs to fetch an instruction during the same cycle in which another instruction accesses data. 1- Draw a pipeline diagram to show where the code above will stall. 2- In general, is it possible to reduce the number of stalls/ NOPs resulting from this structural hazard by reordering code (reordering the instructions)? 3- Must this structural hazard be handled in hardware? We have seen that data hazards can be eliminated by adding NOPs to the code. Can you do the same with this structural hazard? If so, explain how. If not, explain why not. 4- If we run the code above on a single-cycle computer, what kind of hazards are there? Student should write a justification…
Determine the effective CPI, MIPS rate, and execution time for this program. Consider two different machines, with two different instruction sets, both of which have a clock rate of 200 MHz. The following measurements are recorded on the two machines running a given set of benchmark programs: Instruction Count (millions) Instruction Type Machine A Arithmetic and logic Load and store Branch Others Machine A Arithmetic and logic Load and store Branch Others 8424 10 9824 Cycles per Instruction 1343 1243 4 a. Determine the effective CPI, MIPS rate, and execution time for each machine. b. Comment on the results.