Given an instruction sequence with instructions in classes A, B, and C as the table below (same as the last two questions): Instruction Class A BC |CPI Instruction Count|10|40|10 2 1 3 Suppose we are considering improving the execution with the following restrictions: We can only select one class of instructions to improve; and • We will be able to reduce the execution time for the selected instruction class by 50%; No changes to other instructions. Which instruction class should we select to achieve the most improvement? class A class B class C Either one: the improvement will always be the same.

Given an instruction sequence with instructions in classes A, B, and C as the table below (same as the last two questions): Instruction Class A BC |CPI Instruction Count|10|40|10 2 1 3 Suppose we are considering improving the execution with the following restrictions: We can only select one class of instructions to improve; and • We will be able to reduce the execution time for the selected instruction class by 50%; No changes to other instructions. Which instruction class should we select to achieve the most improvement? class A class B class C Either one: the improvement will always be the same.

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

Consider two different implementations, 1 and 12, of the same instruction set. There are three classes of instructions (A, B, and C) in the instruction set. I1 has a clock rate of 6GHZ, and 12 has a clock rate of 3GHZ. The average number of cycles for each instruction class on 1 and 12 is given in the following table: CPI on 12 C1 Usage C2 Usage Class CPI on 11 C3 Usage A 2. 40% 40% 50% 40% 20% 25% 5 20% 40% 25% The table also contains a summary of average proportion of instruction classes generated by three different compilers. C1 is a compiler produced by the makers of 1, C2 is produced by the makers of 12, and the other compiler is a third-party product. Assume that each compiler uses the same number of instructions for a given program but that the instruction mix is as described in the table. Using C1 on both 1 and 12, how much faster can the makers of 1 claim 1 is compared to 12? Using C2, how much faster can the makers of 12 claim that 12 is compared to 1?
J5
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
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
Instructions per second is a measure of a computer's processor speed. For complex instruction set computers, different instructions take different amounts of time, so the value measured depends on the instruction. Evaluate the statement below and show how to compile it by using an instruction set machine of three-address, two-address, and one- address. A*B Y = C+D
Computer Science
Problem 4 There are two approaches for scheduling tasks on multiprocessor platform: the partitioned approach and the global approach. The table below shows Ci (WCET) and Ti (period) for six periodic tasks to be scheduled on m = 3 processors. The relative deadline of each periodic task is equal to its period. T T1 10 T2 10 25 T3 12 30 T4 10 T5 8. 20 T6 7 100 The task set is schedulable using rate-monotonic partitioned scheduling algorithm. Show how the task set is partitioned on m = 3 processors so that all the deadlines are met?
one Mil Q#1: Consider the instruction: add $2, $1, $3 What registers will be written and what registers will be read to execute this instruction? Registers to be written Registers to be read Q#2: Since we only support the add instruction, we don't care much for opcodes and funct codes and shamts. Therefore, suppose our programs are given to the processor as three inputs RD, RS, and RT. Each instruction executes within 1 clock periods Translate the following program to the RW, RS, RT inputs (in binary). clock period RD RS 1 2 3 4 RS RT Program add $2, $1, $3 add $0, $0, $1 add $1, $2, $2 add $1, $1, $1 Q#3: Design the single-cycle cessor datapath (only ID, EX and WB stages) using the mong different components. following datapath components.rly s the number of bits to be transferred in each data line and data bus connectio RD cik Registers RA RB RW BusA RegWrite Bus8 Bus W ALU zero ALU result overflow RT ALUOP
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.
i want all the staps Consider a computer which has a memory which is capable of storing 4096 K words and each word in memory can be of size 32 bits. The computer supports a total of "6" addressing modes, and it has “50" computer registers. The computer supports instructions, where each instruction consists of following fields: • Mode • Operation code • Register • Register • Memory Address Given that each instruction will be stored in one memory word, discuss with a suitable diagram the format of instruction by specifying number of bits for each field of instruction. Discuss each field of instruction
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,…
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?