Suppose that the execution time of a given program on a single processor is 9.5 ms. If you run this program on a system having 18 independent processors, you observe an overall speedup of 1.1. Using Amdahl’s Law, what must have been the fraction of the program that could be executed in parallel? (Express the answer in decimal form, i.e., if 50% of the program can be enhanced, enter 0.5. Round to three decimal places)

Suppose that the execution time of a given program on a single processor is 9.5 ms. If you run this program on a system having 18 independent processors, you observe an overall speedup of 1.1. Using Amdahl’s Law, what must have been the fraction of the program that could be executed in parallel? (Express the answer in decimal form, i.e., if 50% of the program can be enhanced, enter 0.5. Round to three decimal places)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.6: Nested Loops

Problem 2E

See similar textbooks

Similar questions

I need to check the following: first take two integer values let say x and y, multiply them (keep the product in new variable integerP) and check if multiplication caused overflow. Then take variable integerP and multiply it by 1 billion and check for overflow again. Make the same for float point values. In C language
In Big-Θ notation, analyze the running time of the following piece of code/pseudo-code. Describe the running time as a function of the input size (here, n). You should always explain your work when solving mathematics problems.
Consider the given code, answer the following.
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
Suppose a task consists of n subtasks Ji ’s, each of which has computation time Ci , i=1,...,n. This task requests service at time T and has absolute deadline D. Provide a formula to compute the latest start time for each subtask such that the deadline of the entire task can be satisfied. (Please type out the answer)
Using any digital flowcharting tool ( Lucidchart, Vizio), write 4 UML functions. Each one should take in a pair of numbers and then print out all integer values between (and including) those two numbers. You may assume the lower number comes first. Use these 4 types of loop for each of the four functions: while, do-while, automatic counter, and recursion. Clearly identify each one.
QUESTION 36 Match the following expressions to the written request. ✓ Write x + y as a sum-of-products in the variables x and y. ✓ Write x(y + 1) as a sum-of-products in the variables x and y. ✓ Write (x + y)(x + y) as a sum-of-products in the variables x and y. Write 1 as a sum-of-products in the variables x and y A. xy + xy B. xy + xy C. xy + xy + xy D. xy + xy + xy + xy
b) You are given the task of analyzing how joyful a person is. If you are given a list of numbers that represent the emotional value of an individual on each day, design a divide and conquer algorithm to find the most joyous interval of the person. The measure of joy is given as sum of the values in interval multiplied by the smallest integer in the interval.
language: Python Problem: Define a global variable, countcalls, and increment it inside a power(x, n) function, so that it counts the number of times the power function is called. Show that it produces the expected number of calls for power(2, 10) and power(5, 10) and power(5, 0), each separately.
For each of the following three program fragments:a. Give an analysis of the running time (Big-Oh will do).b. Implement the code in the language of your choice, and give the running time for several values of N (100, 500, 1000, 5000).c. Compare your analysis with the actual running times. (1) sum = 0; for( i = 0; i < n; ++i )++sum; (2) sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < n * n; ++j ) ++sum;(3) sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < i * i; ++j ) for( k = 0; k < j; ++k ) ++sum;
ما 2. Write a program that implements the first order (linear) interpolations.. 3. Use the program to apply first order (linear) interpolation to the function f(x)=sin(x²) initially calculated in 10 uniform points in the interval [0.0, 5.0]. (1) 4. Write a program that implements n-point Lagrange interpolation. Treat n as an input parameter. 5. Use third and fifth order polynomial interpolation to interpolate the function f(x) Equation (1) above.
using greedy algorithm (scheduling), write a c++ code In your program: a. Implement the problem above using C/C++ programming language. Do apply the techniquesfor good programming practices. Ensure that appropriate validations are done on your inputdata. b. Sample Input: The user should be allowed to input the following information:i. Maximum weight a truck is allowed to carryii. Number of oversized items to ship for the dayiii. Weight of each oversized itemiv. Priority status for oversized item (if applicable) Sample Output:i. Oversized items that were loaded into each truckii. Amount of unused space (weight) for each truckiii. Number of trucks that were not utilized/loaded (if any)iv. List of oversized items that could not be shipped (including priority status, if applicable)