a) 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)? b) If we want to reduce the total execution time by 20% by optimizing class A only, what is the arget execution time of class A instructions in order to achieve the reduction (assuming all other nstructions are not changed)? c) Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify vour answer.

a) 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)? b) If we want to reduce the total execution time by 20% by optimizing class A only, what is the arget execution time of class A instructions in order to achieve the reduction (assuming all other nstructions are not changed)? c) Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify vour answer.

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

Please write down a Clingo program that finds the stable models of the following ASP program. p -q q+p T You should write down 3 Clingo rules, each one is below an instruction in the form of "% INSTRUCTION%". (Note that you will not get the result by clinking "Run" in this question.) **** 1 your answer = 2 % Clingo Program Starts Here %% 3 %% (Please do not modify anything out of this range) %*% 4 5 % Rule 1 % 6 7 8 % Rule 2 % 9 10 11 % Rule 3 % 12 13. 14 %% Clingo Program Ends Here %% Run *** 15 Reset
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
d) Find the fastest way through the assembly line below clearly showing the for step of solving dynamic programming problems 4 4 3 9 7 p 9 8 3 1 2
Complete the following analysis of an algorithm such that the time complexity, T(n), of the given algorithm is determined. The analysis uses instruction count (i.e. number of times the statement is executed) as the measure for the analysis. The instruction count of each instruction in the algorithm is indicated at the right of the statement after the //. You should replace each of the question marks(?) by the corresponding instruction count in order to complete the analysis. The total instruction count is obtained by adding all the instruction counts. Note that in this exercise, the binary search algorithm is analyzed in a case where the item to be searched is assumed to be NOT found in the sorted array (i.e. Worst Case Analysis). // Worst Case Analysis (e.g., item not in array)int binarySearch(item, sortedArray) { // Instruction Countint low = 0; // 1int high = sortedArray.length - 1; // 1int mid = 0; // 1while (low <= high) { // ≈ log(n) + 1mid = (low + high) / 2; // ≈ log(n)if…
Give reasoning as to why the program is correct. Please do not write code.
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.
**********Solve this task using Assembly Language and emu8086 software and please provide screenshots.********* SOLVE IT ONLY IF YOU KNOW ASSEMBLY LANGUAGE AND THE SOFTWARE EMU8086,
The following table shows the execution time for three computers A, B, C that run three programs. A is the reference machine, use Geometric mean to compare the performance of the three computers. Which computer has the best performance? A A* Program 1 30 60 15 1.0 Program 2 20 100 80 1.0 Program 3 10 5 25 1.0 B.
There are 12 processors in a network, each processor stores a different piece of information about a certain task. Assume that the time required to send information from one processor to another processor regardless of its size takes 100 microseconds. It is required that all the information (12 different pieces) about this task be available to all of the 12 processors. a) Find an algorithm to solve this problem in minimum time? b) Calculate its complexity and efficiency? c) Implement the above problem and submit the code.
2) Execute Sam's Algorithm on the same problem studied in class with the same starting and finish times: i 1 3 4 5 6. 7 8 9. 10 11 Si 1 3 5 3 6. 8. 8. 12 fi 4 6. 7 9 9. 10 11 12 14 16 Explain in detail only how you determine the first two activities you select. Provide the set S of activities Sam's Algorithm selects.
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?