edited by
28,813 views
60 60 votes

In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by $\text{20\%}$ and the speed of a fixed point unit has been increased by $\text{10\%}$. What is the overall speedup achieved if the ratio of the number of floating point operations to the number of fixed point operations is $2:3$ and the floating point operation used to take twice the time taken by the fixed point operation in the original design?

  1. $1.155$
  2. $1.185$
  3. $1.255$
  4. $1.285$

12 Answers

Best answer
75 75 votes
SpeedUp $=\dfrac{\text{Original time taken}}{\text{new time taken}}$

Let $x$ be the time for a fixed point operation,

Original time taken $=\dfrac{(3x + 2\times 2x)}{5} =\dfrac{7x}{5}$
New time taken $=\dfrac{\left(\dfrac{3x}{1.1} + \dfrac{4x}{1.2}\right)}{5}=\dfrac{8x}{1.32\times 5}$
So, SpeedUp $=\dfrac{7\times 1.32}{8} =1.155$

Correct Answer: $A$
edited by
96 96 votes

You can tabulate down the given data from question.

  Speed in Original Design Speed in New Design # of Operations given(2:3)
Floating Point (FP) operations 100 120 2x
Fixed Point (XP) operations 200 220 3x

Here, Speed = #operations per unit time (Just like speed = distance/time)

Took 100,200 for FP and XP for easy understanding.

Say 5x is total number of operations, in which 2x FP and 3x XP operations

Speed up = $\frac{Time in Original Design}{Time  in New Design}$

=>$\frac{2x/100 + 3x/200}{2x/120 + 3x/220}$ (Since we know time = #operations/speed)

we get Speed up = 1.155, So Option (A)

Hope this solution was easy to understand

20 20 votes
  • $k$ = no of times one floating point operation takes more time than one fixed point operation.
  • $x:y$ = ratio of no of fixed point operations to that of floating point operations.
  • $a$ = % increase in speed of floating point unit in fraction {i.e. 20% means $a$ = $0.2$}
  • $b$ = % increase in speed of fixed point unit

Then Net speedup 

$\begin{align*} S &= \frac{\text{total time in old design}}{\text{total time in new design}} \\ & = \frac{ky+x}{\frac{ky}{1+a}+\frac{x}{1+b}} \end{align*}$

Putting all these values S = $1.155$.

NOTE: That is not a standard formula. It has been derived , by taking total time  = $T$ and total operations = $N$

10 10 votes
Suppose we have 20 floating instructn and 30 fixed.

Initially Speed of Floating instruction is 20 and fixed is 10,

so total time=20*20+30*10=700

After increasing float speed 20%=speed(float)=24

10% increase in fixs speed=speed(fix)=11

So total time= 24*20+30*11=480+330=810

Speed up=810/700=1.1571
4 4 votes
in old cpu

let us assume fixed operation takes=1 unit time

then float operation takes = 2 unit time

as the operation are given 2:3

lets consider 2 float and 3 fixed operation

total execution time= 2*2 +3*1=7

in new machine

float takes 20% less time  = 2*80/100 =1.6

fixed take 10% less time   = 1*90/100= .9

total execution time = 1.6*2 + .9*3 = 5.9

speedup= performance of new machine/ performance of old machine

performance is inversely proportional to execution time

so speedup= execution time of old / execution time of new

                = 7/5.9

                =1.185
Answer:
Position:
Show:

Related questions

78 78 votes
8 answers 8 answers
38.2k
38.2k views
Ishrat Jahan asked Nov 2, 2014
38,205 views
The storage area of a disk has the innermost diameter of $10$ cm and outermost diameter of $20$ cm. The maximum storage density of the disk is $1400$ bits/cm. The disk ro...
36 36 votes
3 answers 3 answers
12.3k
12.3k views
Ishrat Jahan asked Nov 2, 2014
12,300 views
A CPU has only three instructions $I1, I2$ and $I3,$ which use the following signals in time steps $T1-T5$:$I1 : T1$ : Ain, Bout, Cin $T2$ : PCout, Bin $T...
60 60 votes
5 answers 5 answers
24.6k
24.6k views
Ishrat Jahan asked Nov 2, 2014
24,563 views
Consider a fully associative cache with $8$ cache blocks (numbered $0-7$) and the following sequence of memory block requests:$4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, ...
48 48 votes
5 answers 5 answers
20.6k
20.6k views
Ishrat Jahan asked Nov 2, 2014
20,638 views
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop:for (i = 1; i < = 1000; i++) {I1, I2, I3, I4}where the time taken (in ns...