1) p1 = 0.6 [ as 60% is parallel]
s1 = 5 [ as there are 5 processors so, for parallel parts speedup will be 5 times]
p2 = 0.4 [ serial part]
s2 = 2 [ Given]
According to Amdal's Law overall speedup S(s) = 1/(p1/s1 + p2/s2) = 1/(0.6/5 + 0.4/2) = 1/(0.12 + 0.2) = 1/0.32 = 3.125
2) p = 0.9
s = 10 [ as we are making it 10 times faster]
According to Amdal's Law overall speedup S(s) = 1/(1-p + p/s) = 1/(0.1 + 0.9/10) = 1/(0.1 + 0.09) = 1/0.19 = 5.263
3) p1 = 0.11 and s1 = 1
p2 = 0.18 and s2 = 5
p3 = 0.23 and s3 = 20
p4 = 0.48 and s4 = 1.6
According to Amdal's Law overall speedup S(s) = 1/(p1/s1 + p2/s2 + p3/s3 + p4/s4) = 1/(0.11/1 + 0.18/5 + 0.23/20 + 0.48/1.6) = 1/(0.11 + 0.036 + 0.0115 + 0.3) = 1/0.4575 = 2.186
2. Given Amdal's Law as shown below (1-2) Form A: T(0,N) 1 Form B:S(s) = (1-p)+...
Compller A Compler B Execution Ti Execution Time No. Instructions meNo. Instructions b. 1.9 s 1.60E+09 1.30E+09 2.1 s 1.71 [5] <1.4> For the same program, two different compilers are used. The table above shows the execution time of the two different compiled programs. Find the average CPI for each program given that the processor has a clock cycle time of 1 ns. 1.7.2 [5] <1.4> Assume the compiled programs run on two different processors If the execution times on...
Page 2 SECTIONA (a) To improve the performance of a computer, a new design aims to raise the overall system speed by 1.5 times of the original version It is known that the system performance efficiency is contributed to by both CPU (40%) and memory (60%). In the new design, only the CPU can be changed By using Amdahl's law, calculate how much faster the new CPU must perform to meet the overall speed-up requirement. (6 marks) b) In the...
Table 1: Load 26% Compare 14% Shift left and shift right 4% Store 9% Load immediate 4% AND 3% Add 14% Conditional branch 17% OR 5% Sub 0% Jump 1% Other register-register instructions (XOR, NOT, etc.) 1% Multiply 0% Call 1% Divide 0% Return 1% Using the data in Table 1, which of the following two enhancements will result in faster execution of the five benchmark programs that are described by the instruction frequency data? Assume that the computer used...
Design and implement a C Language program that measures the performance of given processors. There are several metrics that measure the performance of a processor. We will be using the following 3 measures: 1.CPI (clock cycles per instruction) = #clock cycles /#instructions 2.CPU execution time = #instructions x CPI x clock cycle time . cylce time = 1/CPU clock rate in hertz units 3.MIPS (mega instructions per second)= #instrucrions/ CPU X 1000000 Typically, processors’ performance is measured using a wide...
2. If n points are connected to form a closed polygon as shown below, the area A of the polygon can be computed as n-2 Notice that although the illustrated polygon has only six distinct corners, n for this polygon is 7 because the algorithm expects that the last point, (es yo), wil be a repeat of the initial point, (ox Yo) (x0,y0) = (xi.y1) x2,y2) (x3.V3) (x5-%) (x4 Y4) a. Name your program file lab9p4 b. Do not write...
Refer to the following program sample to answer the parts (a-i) below. Keep in mind that low and high are both indices of array A. /1 Assume that A is a sorted array containing N integers // Assume that x is a variable of type int int low= 0; // Line 1 int high- N; // Line 2 while (low- high) I/ Line 3 m- (lowthigh)/2; // Line 4 (This is integer division) if (A [m]<) I/Line 5 then low-...
You are given a finite step function xt=-1 0<t<4 1 4<t<8. Hand calculate the FS coefficients of x(t) by assuming half- range expansion, for each case below. Modify the code below to approximate x(t) by cosine series only (This is even-half range expansion). Modify the below code and plot the approximation showing its steps changing by included number of FS terms in the approximation. Modify the code below to approximate x(t) by sine series only (This is odd-half range expansion).. Modify...
20 points) Consider the periodic signal z(t) shown in the Figure below: X(t) 3 2 N. 0 1 2 3 4 5 6 A . Determine the fundamental period T and the fundamental frequency wo. B. Compute the Fourier Series coefficients and simplify the expression to its simplest form.
Consider recurrence T(n) = 2T () +n Ign. Assume T (1) = : 0(1) Draw its recursion tree using your favorite tool. Follow the instructions (regarding the tree, step 1~3) to format your tree. Level Tree Node Per-Level Cost . 1 O Step 1: Draw the "head" of the tree. Step 2: Start at level 0, draw the tree downto level 2. 2 cn 1X CP = CP Tw/2 (wa), T(1/2) 1 cn/2 cn/2 28 cm/2 = 0 T( W22)...
3. Evaluate using the correct form -dx 0 x-2 4. Consider the sequence 3n n+1 Does the sequence converge or diverge. If it convergés, to what does it converge?