Suppose a program runs on a machine with multiply operations responsible for 60% of execution time, divide operations responsible for 20% of execution time, and other operations responsible for 20% of execution time. a. How much do we have to improve the speed of multiplication if we want the program to run two times faster? b. What is the speedup of the machine if the division operations improved by 4?

Suppose a program runs on a machine with multiply operations responsible for 60% of execution time, divide operations responsible for 20% of execution time, and other operations responsible for 20% of execution time. a. How much do we have to improve the speed of multiplication if we want the program to run two times faster? b. What is the speedup of the machine if the division operations improved by 4?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter6: User-defined Functions

Section: Chapter Questions

Problem 31SA

See similar textbooks

Similar questions

Write the mnemonics of the following program: The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the ‘D’ register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register ‘D’. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78, 65, 89, 56, 75
Answer the given question with a proper explanation and step-by-step solution. Write an MIPS program that computes terms of the Fibonacci series, defined as: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ... (This is sometimes started with a 0th term: 0, 1, 1, 2, etc.)The first two terms in the series are fixed, and each subsequent term in the series is the sum of the preceding two terms. So, for example, the term 13 is the sum of the terms 5 and 8.Write the program as a counting loop that terminates when the 100th term of the series has been computed. Use a register for the current term and a register for the previous term. Each execution of the loop computes a new current term and then copies the old current term to the previous term register. Count the number of passes to stop after the 100th term. Do not worry about overflow: this will FAR exceed the capacity of a register to hold the value. Stop the program with a syscall with 10 in $v0.
Write the robot program using the VAL+ for the following automation case. First draw the problem; then handwrite the VAL+ code. The robot picks up FIVE blocks of size 100x100x100 mm that are stacked at a fixed position and place them at the corners and center of a square table of size 500 x 500 mm. Select the original position on the table on your own.
When you speak about execution flow, could you maybe explain precisely what you mean by that?
1) Implement a subprogram which takes 4 numbers in the argument registers $a0...$a3, andreturns the largest value and the average in $v0 and $v1 to the calling program. Theprogram must be structured as follows:Subprogram largestAndAverage($a1, $a2, $a3, $a4){ int var0 = $a0, var1 = $a1, var2 = $a2, var3 = $a3; $s0 = getLarger($a1, $a2); $s0 = getLarger($s0, $a3); $v0 = getLarager(s0, $a4); // Largest is in $v0 $v1 = (var0 + var1 + var2 + var3)/ 4; // Aversge is in $v1 return;}Subprogram getLarger($a0, $a1) { $v0 = $a0 if ($a1 > $a0) $v0 = $a1 return;}Note the use of the variables var0...var3. Because the values of $a0 and $a1 (at least) arechanged on the call to getLarger, they will not be available when they are needed to calculatethe average, and must be stored on the stack. To do this problem correctly, you mustcalculate the maximum value using the getLarger subprogram shown here, and it must becalled before the average is calculated. This implies that at a minimum $a0 and $a1…
2. A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail a. 50% b. 60% c. 10% d. 70%
Could you explain on what you mean by "execution flow"?
create a 2 tape Turing machine (use JFLAP) that has on tape 1 the alphabet of a,b,null, on tape 2 the alphabet is 0,1,2,3, null. Tape 1 has initial content of (a+b)*, Tape 2 has initial content of (0+1)* Begin by processing tape 1, if the substring aa is found on tape 1, search tape 2 for the first 00 substring and replace it with 22 if the substring bb is found on tape 1, search tape 2 for the first 11 substring and replace it with 33. If at anytime aa does not have a matching 00 reject if at anytime bb does not have a matching 11 reject else accept after all of tape 1 has been processed.
The task should be presented in Latex, showing the codes used and the results of executing said codes. Realize a function called power where the inputs are a complex number z, a complex number c and a value α ∈ R and the output is the value of zc for the branch where |z| > 0 and α< arg(z)
Define execution time.
for C++ write a progam for the greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y. The gcd of x and y is defined recursively as follows. If y is 0 the answer is x; otherwise gcd(x, y) is gcd(y, x%y).
Write the Fibonacci Function program with: Recursive and Iterative method respectively using the following condition: Fib (1) is 1 Fib (2) is 1 Fib (N) is Fib (N-2) + Fib (N-1), for N > 2 Show the Hand Simulations of activation records for both the programs and display the output