-
Notifications
You must be signed in to change notification settings - Fork 0
/
map_test.go
298 lines (242 loc) · 6.25 KB
/
map_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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
package main
import (
"math/rand"
"runtime"
"strconv"
"sync"
"sync/atomic"
"testing"
"time"
"github.com/stretchr/testify/assert"
)
const NUM_KEYS = 1_000_000
// testSetGet tests single thread correctness
func testSetGet(t *testing.T, m ConcurrentMap) {
testTable := map[string]string{
"test-key": "test-value",
"test-key-1": "test-value-1",
}
for key, value := range testTable {
// Ensure key doesn't exist
_, exists := m.Get(key)
assert.False(t, exists)
// Set key
m.Set(key, value)
// Ensure the key we just set exists
// and is correct value
val, exists := m.Get(key)
assert.True(t, exists)
assert.Equal(t, value, val)
}
}
// testSetGet tests concurrent correctness, ensuring changes
// made by one goroutine are visible in another
func testConcurrentSetGet(t *testing.T, m ConcurrentMap) {
wg := sync.WaitGroup{}
wg.Add(2)
// Setter thread
go func() {
for i := 0; i < NUM_KEYS; i++ {
m.Set(strconv.Itoa(i), strconv.Itoa(i))
}
wg.Done()
}()
// Getter thread. Delayed to ensure key has been set
// already
go func() {
time.Sleep(10 * time.Millisecond)
for i := 0; i < NUM_KEYS; i++ {
val, exists := m.Get(strconv.Itoa(i))
assert.True(t, exists)
assert.Equal(t, strconv.Itoa(i), val)
}
wg.Done()
}()
wg.Wait()
}
func test(t *testing.T, m ConcurrentMap) {
testSetGet(t, m)
testConcurrentSetGet(t, m)
}
func TestUnshardedSingleMutex(t *testing.T) {
test(t, NewUnshardedSingleMutexMap())
}
func TestUnshardedSingleRWMutex(t *testing.T) {
test(t, NewUnshardedSingleRWMutexMap())
}
func TestShardedMultiMutexMap(t *testing.T) {
test(t, NewShardedMultiMutexMap(32))
}
func TestShardedMultiRWMutexMap(t *testing.T) {
test(t, NewShardedMultiRWMutexMap(32))
}
func TestShardedMultiSegragatedRWMutexMap(t *testing.T) {
test(t, NewShardedMultiSegragatedRWMutexMap(32))
}
func TestOrcamanLibrary(t *testing.T) {
test(t, NewOrcamanLibrary())
}
func TestFanliaoLibrary(t *testing.T) {
test(t, NewFanliaoLibrary())
}
func TestTidwallLibrary(t *testing.T) {
test(t, NewTidwallLibrary())
}
/*
func TestCornelkLibrary(t *testing.T) {
test(t, NewCornelkLibrary())
}
*/
func TestDustinxieLibrary(t *testing.T) {
test(t, NewDustinxieLibrary())
}
func TestSyncMap(t *testing.T) {
test(t, NewSyncMap())
}
// benchmarkMapSets performs sets concurrently
func benchmarkMapSet(b *testing.B, m ConcurrentMap) {
// Prefill the sets we will perform on the
// map
setKeys := make([]string, NUM_KEYS)
for i := 0; i < NUM_KEYS; i++ {
setKeys[i] = getRand(15)
}
setValues := make([]string, NUM_KEYS)
for i := 0; i < NUM_KEYS; i++ {
setValues[i] = getRand(15)
}
ptr := uint32(0)
runtime.GC()
b.ResetTimer()
b.Run("Set", func(sb *testing.B) {
sb.RunParallel(func(pb *testing.PB) {
for pb.Next() {
atomic.AddUint32(&ptr, 1)
m.Set(setKeys[ptr%NUM_KEYS], setValues[ptr%NUM_KEYS])
}
})
})
}
// benchmarkMapGet performs gets concurrently
func benchmarkMapGet(b *testing.B, m ConcurrentMap) {
// Prefill the gets we will perform on the
// map
getKeys := make([]string, NUM_KEYS)
for i := 0; i < NUM_KEYS; i++ {
getKeys[i] = getRand(15)
}
ptr := uint32(0)
runtime.GC()
b.ResetTimer()
b.Run("Get", func(sb *testing.B) {
sb.RunParallel(func(pb *testing.PB) {
for pb.Next() {
atomic.AddUint32(&ptr, 1)
_, _ = m.Get(getKeys[ptr%NUM_KEYS])
}
})
})
}
// benchmarkMapMix tests alternating sets and gets in parallel.
// This should simulate a balanced set/get load
func benchmarkMapMix(b *testing.B, m ConcurrentMap) {
// Prefill the sets we will perform on the
// map
setKeys := make([]string, NUM_KEYS)
for i := 0; i < NUM_KEYS; i++ {
setKeys[i] = getRand(15)
}
setValues := make([]string, NUM_KEYS)
for i := 0; i < NUM_KEYS; i++ {
setValues[i] = getRand(15)
}
// Prefill the gets we will perform on the
// map
getKeys := make([]string, NUM_KEYS)
for i := 0; i < NUM_KEYS; i++ {
getKeys[i] = getRand(15)
}
setPtr := uint32(0)
getPtr := uint32(0)
runtime.GC()
b.ResetTimer()
b.Run("Mix", func(sb *testing.B) {
sb.RunParallel(func(pb *testing.PB) {
for pb.Next() {
set := false
if set {
atomic.AddUint32(&setPtr, 1)
m.Set(setKeys[setPtr%NUM_KEYS], setValues[setPtr%NUM_KEYS])
} else {
atomic.AddUint32(&getPtr, 1)
_, _ = m.Get(getKeys[getPtr%NUM_KEYS])
}
set = !set
}
})
})
}
func benchmark(b *testing.B, m ConcurrentMap) {
b.ResetTimer()
benchmarkMapGet(b, m)
benchmarkMapSet(b, m)
benchmarkMapMix(b, m)
}
func BenchmarkUnshardedSingleMutex(b *testing.B) {
benchmark(b, NewUnshardedSingleMutexMap())
}
func BenchmarkUnshardedSingleRWMutex(b *testing.B) {
benchmark(b, NewUnshardedSingleRWMutexMap())
}
func BenchmarkShardedMultiMutexMap(b *testing.B) {
benchmark(b, NewShardedMultiMutexMap(32))
}
func BenchmarkShardedMultiRWMutexMap(b *testing.B) {
benchmark(b, NewShardedMultiRWMutexMap(32))
}
func BenchmarkShardedMultiSegragatedRWMutexMap(b *testing.B) {
benchmark(b, NewShardedMultiSegragatedRWMutexMap(32))
}
func BenchmarkOrcamanLibrary(b *testing.B) {
benchmark(b, NewOrcamanLibrary())
}
func BenchmarkFanLiaoLibrary(b *testing.B) {
benchmark(b, NewFanliaoLibrary())
}
func BenchmarkTidwallLibrary(b *testing.B) {
benchmark(b, NewTidwallLibrary())
}
/*
func BenchmarkCornelkLibrary(b *testing.B) {
benchmark(b, NewCornelkLibrary())
}
*/
func BenchmarkDustinxieLibrary(b *testing.B) {
benchmark(b, NewDustinxieLibrary())
}
func BenchmarkSyncMap(b *testing.B) {
benchmark(b, NewSyncMap())
}
const letterBytes = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
const (
letterIdxBits = 6 // 6 bits to represent a letter index
letterIdxMask = 1<<letterIdxBits - 1 // All 1-bits, as many as letterIdxBits
letterIdxMax = 63 / letterIdxBits // # of letter indices fitting in 63 bits
)
// https://stackoverflow.com/questions/22892120/how-to-generate-a-random-string-of-a-fixed-length-in-go
func getRand(n int) string {
b := make([]byte, n)
// A rand.Int63() generates 63 random bits, enough for letterIdxMax letters!
for i, cache, remain := n-1, rand.Int63(), letterIdxMax; i >= 0; {
if remain == 0 {
cache, remain = rand.Int63(), letterIdxMax
}
if idx := int(cache & letterIdxMask); idx < len(letterBytes) {
b[i] = letterBytes[idx]
i--
}
cache >>= letterIdxBits
remain--
}
return string(b)
}