Question 3Table 1.1: Execution timesBenchmarkProcessorXY12010402408020Table 1.1 shows the execution times, in seconds, for two different benchmark programs onthree machines.i.Compute the arithmetic mean value for each system using X as the reference machineand then using Y as the reference machine. Argue that intuitively, the three machineshave roughly equivalent performance and that the arithmetic mean gives misleadingresults.ii. Compute the geometric mean value for each system, using X as the reference machineand then using Y as the reference machine. Argue that the results are more realisticthan with the arithmetic mean.Question 4i.Consider an L1 cache with an access time of 1 ns and a hit ratio of Suppose that wecan change the cache design (size of cache, cache organization) such that we increaseH to 0.97, but increase access time to 1.5 ns. What conditions must be met for thischange to result in improved performance?ii.Explain why this result makes intuitive sense.1Question 5i. List some reasons why it is worthwhile to study assembly language programming.ii. Section 15.4 includes a C program that calculates the greatest common divisor of twointegers. Describe the algorithm in words and show how the program does implementthe Euclid algorithm approach to calculating the greatest common divisor. Question 1You are to write an IAS program to compute the results of the following equation.Y =Assume that the computation does not result in an arithmetic overflow and that X, Y, and Nare positive integers with N2 1. Note: The IAS did not have assembly language, onlymachine language.N(N + 1)Sum(Y) =i.Use the equation2when writing the IAS program.ii.Do it the "hard way," without using the equation from part (i).Question 2a. On the IAS, what would the machine code instruction look like to load the contents ofmemory address 2 to the accumulator?b. How many trips to memory does the CPU need to make to complete this instructionduring the instruction cycle?Question 3Table 1.1: Execution timesBenchmarkProcessorXY12010402408020Table 1.1 shows the execution times, in seconds, for two different benchmark programs onthree machines.i.Compute the arithmetic mean value for each system using X as the reference machineand then using Y as the reference machine. Argue that intuitively, the three machineshave roughly equivalent performance and that the arithmetic mean gives misleadingresults.

“Since you have asked multiple questions, we will solve the first question for you. If you want any…

Table 1.1: Execution times Benchmark Processor X Y 1 20 10 40 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results. ii. Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean.

Table 1.1: Execution times Benchmark Processor X Y 1 20 10 40 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results. ii. Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean.

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

compute MIPS for two different machines running a given set of benchmark programs: No. of No. of instructions cycles per instruction Instruction category (in millions) Machine (A) ALU 8 1 Load & store 4 3 Branch Others Machine (B) ALU 10 1 Load & store 8. 2 Branch Others 4
part a,b and c already answered earlier Part D and E please only thanks
Your favorite computer program (after being converted to MIPS assembly code, then to machine code) results in 2.5e8 instructions. Consider the three different CPUs and their clock rates and CPIs and determine how much time it would take each of them to execute this program. Rick Sanchez’s computer with a clock rate 7.99 Hz (hertz, not gigahertz) and a CPI of 1.1.
I am really having a hard time finding the average CPI for machine A. Could you help me step by step on how to do this?
A program runs in 20 sec in machine A with a clock speed of 200 MHz. A computer architecture wants to build a machine B which will run this program in 6 seconds. The architect has delivered that a substantial increase in clock rate is possible, but this will affect the design of the rest of the CPU causing machine B to require 1.2 times as many clock cycles as machine A for this program. What clock rate should be targeted for the best design in MHz ?
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
For questions Q11 and Q12, consider a computer running a program that requires 400 s, with 220 s spent executing FP instructions, 100 s executing Ld/St instructions, 60s executing INT instructions and 20 s spent executing branch instructions. Q11. What is the overall speedup if the time for FP operations is reduced by 20%?
Assume that every 18 months, the number of CPU cores available is doubled. How much extra off-chip memory bandwidth will be required for a CPU introduced in three years to retain the same level of per-core performance?
The subject is “information Technology”. The topic of the questions are under the little Man Computer .
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.
Please compute for the CPU utilization:
Consider two different implementations, M1 and M2, of the same instruction set. There are three classes of instructions (A, B, and C) in the instruction set. M1 has a clock rate of 2.0GHz and M2 has a clock rate of 2.5GHz. The average number of cycles for each instruction class and their frequencies (for a typical program) are as follow on the table. (a) Calculate the average CPI for each machine, M1, and M2.(b) Calculate the average MIPS ratings for each machine, M1 and M2