8a84db909a
What used to look like this:
desk_pokemonwiki.skp 9.38ms -> 9.76ms 1x
tabl_pravda.skp 237us -> 241us 1x
desk_css3gradients.skp 249us -> 254us 1x
....
desk_fontwipe.skp 39.6us -> 38.7us 0.98x
tabl_digg.skp 922us -> 893us 0.97x
tabl_gmail.skp 20.7us -> 20us 0.96x
Now will print more like this:
desk_pokemonwiki.skp 9.38ms -> 9.76ms 1.04x
tabl_pravda.skp 237us -> 241us 1.02x
desk_css3gradients.skp 249us -> 254us 1.02x
....
desk_fontwipe.skp 39.6us -> 38.7us 0.98x
tabl_digg.skp 922us -> 893us 0.97x
tabl_gmail.skp 20.7us -> 20us 0.96x
BUG=skia:
Review URL: https://codereview.chromium.org/756643004
41 lines
1.2 KiB
Python
Executable File
41 lines
1.2 KiB
Python
Executable File
#!/usr/bin/env python
|
|
|
|
import sys
|
|
from scipy.stats import mannwhitneyu
|
|
|
|
SIGNIFICANCE_THRESHOLD = 0.0001
|
|
|
|
a,b = {},{}
|
|
for (path, d) in [(sys.argv[1], a), (sys.argv[2], b)]:
|
|
for line in open(path):
|
|
try:
|
|
tokens = line.split()
|
|
samples = tokens[:-1]
|
|
label = tokens[-1]
|
|
d[label] = map(float, samples)
|
|
except:
|
|
pass
|
|
|
|
common = set(a.keys()).intersection(b.keys())
|
|
|
|
ps = []
|
|
for key in common:
|
|
_, p = mannwhitneyu(a[key], b[key]) # Non-parametric t-test. Doesn't assume normal dist.
|
|
am, bm = min(a[key]), min(b[key])
|
|
ps.append((bm/am, p, key, am, bm))
|
|
ps.sort(reverse=True)
|
|
|
|
def humanize(ns):
|
|
for threshold, suffix in [(1e9, 's'), (1e6, 'ms'), (1e3, 'us'), (1e0, 'ns')]:
|
|
if ns > threshold:
|
|
return "%.3g%s" % (ns/threshold, suffix)
|
|
|
|
maxlen = max(map(len, common))
|
|
|
|
# We print only signficant changes in benchmark timing distribution.
|
|
bonferroni = SIGNIFICANCE_THRESHOLD / len(ps) # Adjust for the fact we've run multiple tests.
|
|
for ratio, p, key, am, bm in ps:
|
|
if p < bonferroni:
|
|
str_ratio = ('%.2gx' if ratio < 1 else '%.3gx') % ratio
|
|
print '%*s\t%6s -> %6s\t%s' % (maxlen, key, humanize(am), humanize(bm), str_ratio)
|