Differences between revisions 31 and 32
Revision 31 as of 2008-10-24 02:24:20
Size: 720
Editor: 209-142-131-35
Comment:
Revision 32 as of 2020-01-23 23:15:20
Size: 676
Editor: 68
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
<<latex(Speedup=Performance using enhancement when possiblePerformance without enhancement)>> $Speedup=Performance using enhancement when possiblePerformance without enhancement$
Line 9: Line 9:
<<latex(SpeedupOverall=Old Execution TimeNew Execution Time)>> (1) $$$Speedup Overall = \frac{Old~Execution~Time}{New~Execution~Time}$$$
Line 13: Line 13:
<<latex($$New~Exec~Time = Old~Exec~Time \left( 1 - FractionEnhanced + \frac{FractionEnhanced}{SpeedupEnhanced}\right)$$)>> $$$New~Exec~Time = Old~Exec~Time( 1 - Fraction Enhanced + \frac{Fraction Enhanced}{Speedup Enhanced})$$$
Line 17: Line 17:
<<latex(SpeedupOverall=(11FractionEnhanced+FractionEnhancedSpeedupEnhanced))>> $$$Speedup Overall=\left(\frac{1}{1-Fraction Enhanced + \frac{Fraction Enhanced}{Speedup Enhanced}}\right)$$$

Back to ComputerTerms

Speedup=Performance using enhancement when possiblePerformance without enhancement

See SpeedUp

Notice that we are talking about the entire task here and that performance (speedup) is defined in terms of execution time! So we have to define the following:

SpeedupOverall=Old Execution TimeNew Execution Time

This gives a new Execution time of

New Exec Time=Old Exec Time(1FractionEnhanced+FractionEnhancedSpeedupEnhanced)

So we have

SpeedupOverall=(11FractionEnhanced+FractionEnhancedSpeedupEnhanced)

Back to ComputerTerms

AmdahlsLaw (last edited 2020-01-23 23:15:20 by 68)