|
Size: 666
Comment:
|
Size: 907
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 27: | Line 27: |
| Using the geometric mean gives a consistent ranking, as in: Computer A is faster than computer B. If we use Arithmetic mean (average) we don't get a consistent ranking. However, the arithmetic does give you an '''execution time''' while |
Back to ComputerTerms
Normalize: Given a reference execution time A, take the execution time you have (B) and divide it by the reference execution time. What you get is a normalized execution time of B with respect to A.
Excution time of B
Normalized(B) = ----------------------------
Reference Execution Time A Given several programs P1, P2, ..., Pn, the average (GeometricMean) normalized execution time is
For (i=1; i++, <= n) {
P *= Normalized(Pi)
}
return P^(1/n)
or
_____________
/ n
n / __
/ || Normalized(Pi)
\/ i=1Using the geometric mean gives a consistent ranking, as in: Computer A is faster than computer B. If we use Arithmetic mean (average) we don't get a consistent ranking. However, the arithmetic does give you an execution time while
Back to ComputerTerms
