Two different compilers are being tested for a 1GHZ machine with three different classes of instructions: Class A, Class B, and Class C, which require 2, 4 and 6 cycles (respectively). Both compilers are used to produce code for a large piece of software. Compiler 1 generates code with 4 billion Class A instructions, 1 billion Class B instructions, and 1 billion Class C instructions. Compiler 2 generates code with 8 billion Class A instructions, 1 billion Class B instructions, and 1 billion Class C instructions. i. What is the global CPI for each implementation? ii. Which sequence will be faster?

Two different compilers are being tested for a 1GHZ machine with three different classes of instructions: Class A, Class B, and Class C, which require 2, 4 and 6 cycles (respectively). Both compilers are used to produce code for a large piece of software. Compiler 1 generates code with 4 billion Class A instructions, 1 billion Class B instructions, and 1 billion Class C instructions. Compiler 2 generates code with 8 billion Class A instructions, 1 billion Class B instructions, and 1 billion Class C instructions. i. What is the global CPI for each implementation? ii. Which sequence will be faster?

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

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?
1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program requires 360 seconds, with the number of seconds executing each class as shown in the table below: Instruction Class A B C Time (sec) 100 80 120 60 1.1. By how much is the total execution time changed if the time for class D is reduced by 20% and the time for class C is increased by 10% (assuming no other changes)? 1.2. If we want to reduce the total execution time by 20% by optimizing class A only, what is the target execution time of class A instructions in order to achieve the reduction (assuming all other instructions are not changed)? 1.3. Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify your answer.
Suppose the implementation of an instruction set architecture uses three classes of instructions, which are called A, B, and C. The total dynamic instruction count is 1 x 10^7 and the processor's clock rate is 2.5 GHz. Details for the three classes are given in the table below: Class CPI % of instructions A 1 20% В 50% C 3 30% Complete the following table. Express all answers in scientific notation and round to two decimal places, when needed. Class Instruction Count Number of Clock Cycles x 10^ x 10^ A х 10^ х 10^ x 10^ x 10^
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
Suppose we have two different compilers, A and B, which each compile the same Java program to a particular computer’s machine language. Compiler A results in a program with 2.0 x 109 instructions and a CPU time of 1.1s. Compiler B results in a program with 2.4 x 109 instructions and a CPU time of 1.5s. What is the average CPI for each compiler’s program if the computer’s processor has a clock cycle time of 1ns? Suppose a new compiler C is developed which results in a program with 9.2 x 108 instructions and a CPI of 1.1. What is the speedup of using compiler C instead of compiler A? Instead of compiler B? Suppose we run the programs compiled by compilers A and B on two separate computers. Suppose also that the CPU time for each is exactly the same. How much faster is the clock running compiler A’s code versus the clock running compiler B’s code? (Hint: the first step is to calculate the total cycles each program requires)
Given an instruction sequence with instructions in classes A, B, and C as the table below: Instruction Class A B C |CPI Instruction Count|10|40|10| 2 1 3 Total number of instructions in this sequence = Number of clock cycles from instruction class A = Number of clock cycles from instruction class B = Number of clock cycles from instruction class C = Total number of clock cycles = Average CPI for this instruction sequence = (Answer with a float the decimal point, e.g. 4.5)
Imagine we have a small computer which contains a simplified version of a CPU and RAM. The CPU can execute a single program that is stored in the RAM, and while running the program it can access 3 memory locations: its internal register AL, and two RAM locations that we'll call address 1 and address 2. Since this is a simplified computer it is able to skip some of the steps to access memory that are in our textbook, but accessing RAM still takes longer than accessing AL. The only values this computer is capable of storing in memory are unsigned bytes (8 bit binary numbers), and when it starts running a program all 3 of its memory locations initially contain the value 00000000. Here is a list of all of the instructions our imaginary computer can perform: Write [number] to AL This instruction takes the operand [number], which must be an 8-bit binary number, and puts it into AL. This overwrites whatever was in AL previously. It takes 3 cycles to complete: 1 cycle each to fetch, decode,…
A compiler produces a program with the following mix of instructions: Instruction Class Count 6 9 9 1 2 3 If it is executed on a processor with a clock period of 8 microseconds, and the following Instruction Class CPIs, what is the execution time in microseconds? Round to the nearest 0.1 microseconds. Instruction Class CPI 3 3 10 1 2 3
Consider two different implementations of the same instruction set architecture (ISA). The instructions can be divided into three classes according to their CPI (classes A, B, and C). P1 with a clock rate of 2,5 GHz and CPIS of 1, 2, and 3, and P2 with a clock rate of 3 GHz and CPIs of 2, 2, and 4. Given a program with a dyñamic instruction count of 5 x 10 instructions divided into classes as follows: 30% class A, 30% class B, and 40% class C. A. What is the global CPI for cach implementation? B. which is faster: P1 or P27 By how much? C. Find the clock cycles required in both cases. eet
The CPU design team is designing an instruction set with three classes of instructions. Parameters are given in the following table. Consider a program with 65% ALU instructions, 25% memory access instructions, and 10% control instructions. What is the average CPI for this CPU? Clock Rate 4GHz CPI for ALU Inst. 6 CPI for Memory Inst. 8 CPI for Control Inst. 2
A compiler designer is trying to decide between two code sequences for a particular machine. The hardware designers have supplied the following facts: Instruction class CPI of the instruction class A 1 B 3 C 4 For a particular high-level language, the compiler writer is considering two sequences that require the following instruction counts: Code sequence Instruction counts (in millions) A B C 1 2 1 2 2 4 3 1 a. What is the CPI for each code sequence? b. Which code sequence is faster? By how much?
Question: Suppose a processor P has a 2.5 GHz clock rate and a CPI of 1.5. We are trying to reduce the execution time by 20%, but this leads to an increase of 20% in the CPI. What is The clock rate we should have to get this time reduction? Question: Assume that for a program, compiler C results in an instruction count of 20000 and has an execution time of 50 microseconds. Given that the processor has a clock cycle of 2 ns, what is the average CPI? Question: Continue from the previous question. If a new compiler is developed that uses only 15000 instructions and has an average CPI of 1.3. What is The execution time of using the new compiler on the original processor?