/
probing_bench_test.go
144 lines (130 loc) · 2.9 KB
/
probing_bench_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
package probing
import (
"flag"
"math/rand"
"runtime"
"testing"
)
var (
numKeys = flag.Int("keys", 1e6, "number of unique keys to insert")
numInQueries = flag.Int("in", 1e3, "number of in-map queries")
numOutQueries = flag.Int("out", 1e3, "number of out-of-map queries")
numReplicas = flag.Int("replicas", 1, "number of replicas to use in memory benchmark")
scale = flag.Float64("scale", 1.5, "scale to compute init bucket size")
load = flag.Float64("load", 0, "load factor ( <= 0 or >= 1 means default)")
seed = flag.Int64("seed", 0, "seed to random number generator")
)
var (
keys, inQs, outQs []__Key
filled bool
)
func fillData() {
if filled {
return
}
seen := map[__Key]bool{}
rng := rand.New(rand.NewSource(*seed))
for len(keys) < *numKeys {
k := __Key(rng.Int())
if k == __KEY_NIL {
continue
}
if !seen[k] {
keys = append(keys, k)
seen[k] = true
}
}
for len(inQs) < *numInQueries {
k := keys[rng.Intn(*numKeys)]
inQs = append(inQs, k)
}
for len(outQs) < *numOutQueries {
k := __Key(rng.Int())
if k == __KEY_NIL {
continue
}
if !seen[k] {
outQs = append(outQs, k)
}
}
filled = true
}
func testMap() *__Map {
m := New__Map(int(*scale*float64(*numKeys)), *load)
for _, k := range keys {
*m.FindOrInsert(k) = __Value(k + 1)
}
return m
}
func BenchmarkGoMapSpeed(b *testing.B) {
fillData()
m := make(map[__Key]__Value)
for _, k := range keys {
m[k] = __Value(k + 1)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
for _, k := range inQs {
_ = m[k]
}
for _, k := range outQs {
_ = m[k]
}
}
}
func BenchmarkProbingMapSpeed(b *testing.B) {
fillData()
m := testMap()
for _, k := range keys {
*m.FindOrInsert(k) = __Value(k + 1)
}
// numLookUps = 0
// numCollisions = 0
b.ResetTimer()
for i := 0; i < b.N; i++ {
for _, k := range inQs {
_ = m.Find(k)
}
for _, k := range outQs {
_ = m.Find(k)
}
}
// b.Logf("%.2f hashes per look-up", float64(numLookUps+numCollisions)/float64(numLookUps))
}
func BenchmarkGoMapMem(b *testing.B) {
fillData()
ms := make([]map[__Key]__Value, *numReplicas)
measureMem("go-map", func() {
for i := range ms {
m := make(map[__Key]__Value)
for _, k := range keys {
m[k] = __Value(k + 1)
}
ms[i] = m
}
}, b)
b.SkipNow()
}
func BenchmarkProbingMapMem(b *testing.B) {
fillData()
ms := make([]*__Map, *numReplicas)
measureMem("probing", func() {
for i := range ms {
m := testMap()
if i == 0 {
b.Logf("probing: %d keys; %d buckets; load factor %.2f", m.Size(), len(m.buckets), float64(m.Size())/float64(len(m.buckets)))
}
ms[i] = m
}
}, b)
b.SkipNow()
}
func measureMem(name string, action func(), b *testing.B) {
var before, after runtime.MemStats
runtime.GC()
runtime.ReadMemStats(&before)
action()
runtime.GC()
runtime.ReadMemStats(&after)
b.Logf("%s: %.2fMB", name, float64(after.Alloc-before.Alloc)/float64(1<<20))
}