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 theinstruction set in such a way that the number of instructions has been reduced by15% from the values shown for each benchmark in Exercise 1.12. The executiontimes obtained are shown in the following table.a.Name Execution Time (seconds) Reference Time (seconds)bzip27009650SPECratio13.71.13.2 [10] <1.8> In general, these CPI values are larger than those obtained inprevious exercises for the same benchmarks. This is due mainly to the clock rateused in both cases, 3 GHz and 4 GHz. Determine whether the increase in the CPIis similar to that of the clock rate. If they are dissimilar, why?

Name: Suppose that we are developing a new version of the AMD Barcelona pro
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 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 theinstruction set in such a way that the number of instructions has been reduced by15% from the valu

The answer is given below with proper explanation

Engineering

Computer Science

1.13.2 [10] <1.8> 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?

1.13.2 [10] <1.8> 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?

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

Suppose that a task on the ARM computer runs 256M instructions during its execution. The total time it takes to execute an instruction is 120 ns. We make the assumption that the work to be performed by one instruction can be divided into an arbitrary number of pipeline stages. Now complete the following problems. a. Complete the table by computing the stage time, total execution time, and speedup (relative to the non-pipelined case) for the different pipelining depths. Ignore all hazards. Pipeline depth Stage time Total execution time Speedup 1 120ns 1 4 8 12
Give downvote if plagiarized or from internet A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program? A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program?
Q1. Consider that the up system consists of two memory sections, the SRAM and the EPROM. The up clock system is 5 MHz and the bus cycle is equal to 4-clocks of the system clock pulses. For reading process, suppose that the waiting time of SRAM equals % waiting time of EPROM. If you know that, the total time requires for reading both memory types 1900 ns, what is the total waiting time requires for reading 128 bytes from the SRAM and the total waiting time requires for reading 512 bytes of EPROM? How many wait states require for reading each section of memory? Sketch the required circuit for generating the required number of the wait states.
Two different computer processors are compared by measuring the processing speed fordifferent operations performed by computers using the two processors. Given that 12measurements with the first processor had a standard deviation of 0.1 GHz and 16measurements with the second processor had a standard deviation of 0.15 GHz. Can we say that the processing speed of the second processor is less uniform? Use a 0.05 level of significance. What assumptions should be made so as to show how the two samples are obtained?
We have 4 periodical processes II₁, II, II and II, that process a video. We know their periods P; and their running times C; (in milliseconds). For: (a) the rate monotonic scheduling (RMS) algorithm and (b) the earliest deadline first (EDF) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process Pi Ci II₁ 45 10 II2 40 10 II3 35 5 II4 50 10 In the case of equal priorities the process that is already running has the priority. If this is not the case then take the process with the lowest ID. Does any of the above algorithms fail?
Popular texting services may be found all over the internet nowadays. They're subject to the same regulations as SMS, too.
Consider four processes with the following start and end times: Process Start Time End Time ABCD 3 5 1 7 6 12 4 9 For each pair of proceses, say whether they run concurrently (Y) or not (N). (a) AB (b) AC (c) AD (d) BC (e) BD (f) CD
Question 3: Let us consider a computer executing the following mix of Frequency (IC) 50% 20% 10% 10% 10% Instruction ALU LOAD STORE BRANCH JUMP instructions: Clock cycles (CPI) 3 6 6 4 4 a. How much is the CPI average? b. How much is the Throughput expressed in MIPS, assuming a clock frequency of 2 GHz? Let us assume that, given a hardware optimization technique, 40% of instructions of the program are executed with CPI2 = 2.05 and the remaining fraction of instructions (60%) is executed with the same CPI calculated in the case (a). c. How much is the overall Speedup due to CPI enhancement? d. How much is the new Throughput expressed in MIPS?
5-Consider a computer running a program that requires 400 s, with 80 s spent executing FP instructions, 40 s executed L/S instructions, and 40 s spent execut- ing branch instructions. • By how much is the total time reduced if the time for FP operations is reduced by 5%? • By how much is the time for INT operations reduced if the total time is reduced by 5%? • Can the total time can be reduced by 10% by reducing only the time for branch instructions?
Two algorithms A and B report time complexities expressed by the functions n2and 2n , respectively. They are to be executed on a machine M that consumes 10–6 s to execute an instruction. What is the time taken by the algorithms to complete their execution on machine A for an input size of 50? If another machine N that is 10 times faster than machine M is provided for the execution, what is the largest input size that can be handled by the two algorithms on machine N? What are yourobservations?
Question 5. Let us consider a computer executing the following mix of instructions: Instruction Frequency Clock cycles ALU LOAD STORE BRANCH JUMP 50 20 10 10 10 1 4 4 2 2 a. How much is the CPI average (1) assuming a clock frequency of 500 MHz? How much is the Throughput expressed in MIPS, in the case (1)? 191 b./ Let us assume that, given a HW optimization technique, the 40% of instructions of the program is executed with CPIE = 1.05 and the remaining fraction of instructions (60%) is executed with the same CPI calculated in the case (1). How much is the Speedup from (1) to (2)? How much is the Throughput expressed in MIPS, in the case (2)? Q Let us assume that, given a HW optimization technique, branch and jump instructions require only a single clock cycle. How much is the Throughput expressed in MIPS, in the case (3)? d. Is it better the optimization introduced in (2) or in (3)?
Fill in all blank spaces. All miss penalties should be rounded to the nearest integer. All CPI values should be rounded to one decimal place, if needed. Suppose the following is true about a CPU: It has only L1 cache . The base CPI is 1.5 • The clock rate is 2.5 GHz . The memory access time is 250 ns • The miss rate per instruction at L1 cache is 4% The cache miss penalty is cycles. The new effective CPI is Now suppose the following about the same CPU: • It also has L2 cache • Access time for L2 cache is 13 ns . The miss rate to main memory is reduced by 0.3% The miss penalty for an L1 miss with an L2 hit is The miss penalty for an L1 miss with an L2 miss is The new total CPI in this case is cycles. cycles.