Andrew Noyes
89b3354a80
All checks were successful
Tests / Clang total: 1130, passed: 1130
Clang |Total|New|Outstanding|Fixed|Trend
|:-:|:-:|:-:|:-:|:-:
|0|0|0|0|:clap:
Tests / SIMD fallback total: 1130, passed: 1130
Tests / Release [gcc] total: 1130, passed: 1130
GNU C Compiler (gcc) |Total|New|Outstanding|Fixed|Trend
|:-:|:-:|:-:|:-:|:-:
|0|0|0|0|:clap:
Tests / Release [gcc,aarch64] total: 844, passed: 844
Tests / Coverage total: 848, passed: 848
weaselab/conflict-set/pipeline/head This commit looks good
108 lines
3.8 KiB
Markdown
108 lines
3.8 KiB
Markdown
A data structure for optimistic concurrency control on ranges of bitwise-lexicographically-ordered keys.
|
|
|
|
Intended to replace FoundationDB's skip list.
|
|
|
|
Hardware for all benchmarks is a mac m1 2020.
|
|
|
|
# FoundationDB's benchmark
|
|
|
|
## Skip list
|
|
|
|
```
|
|
New conflict set: 1.957 sec
|
|
0.639 Mtransactions/sec
|
|
2.555 Mkeys/sec
|
|
Detect only: 1.845 sec
|
|
0.678 Mtransactions/sec
|
|
2.710 Mkeys/sec
|
|
Skiplist only: 1.263 sec
|
|
0.990 Mtransactions/sec
|
|
3.960 Mkeys/sec
|
|
Performance counters:
|
|
Build: 0.0546
|
|
Add: 0.0563
|
|
Detect: 1.84
|
|
D.Sort: 0.412
|
|
D.Combine: 0.0141
|
|
D.CheckRead: 0.671
|
|
D.CheckIntraBatch: 0.0068
|
|
D.MergeWrite: 0.592
|
|
D.RemoveBefore: 0.146
|
|
```
|
|
|
|
## Radix tree (this implementation)
|
|
|
|
```
|
|
New conflict set: 1.366 sec
|
|
0.915 Mtransactions/sec
|
|
3.660 Mkeys/sec
|
|
Detect only: 1.248 sec
|
|
1.002 Mtransactions/sec
|
|
4.007 Mkeys/sec
|
|
Skiplist only: 0.573 sec
|
|
2.182 Mtransactions/sec
|
|
8.730 Mkeys/sec
|
|
Performance counters:
|
|
Build: 0.0594
|
|
Add: 0.0572
|
|
Detect: 1.25
|
|
D.Sort: 0.418
|
|
D.Combine: 0.0149
|
|
D.CheckRead: 0.232
|
|
D.CheckIntraBatch: 0.0067
|
|
D.MergeWrite: 0.341
|
|
D.RemoveBefore: 0.232
|
|
```
|
|
|
|
# Our benchmark
|
|
|
|
## Skip list
|
|
|
|
| ns/op | op/s | err% | total | benchmark
|
|
|--------------------:|--------------------:|--------:|----------:|:----------
|
|
| 255.20 | 3,918,570.44 | 0.1% | 0.01 | `point reads`
|
|
| 269.35 | 3,712,633.44 | 0.8% | 0.01 | `prefix reads`
|
|
| 502.72 | 1,989,186.40 | 0.4% | 0.01 | `range reads`
|
|
| 456.85 | 2,188,902.27 | 0.6% | 0.01 | `point writes`
|
|
| 444.81 | 2,248,148.60 | 0.7% | 0.01 | `prefix writes`
|
|
| 250.00 | 4,000,000.00 | 1.7% | 0.02 | `range writes`
|
|
| 566.51 | 1,765,186.07 | 0.5% | 0.01 | `monotonic increasing point writes`
|
|
| 226.41 | 4,416,703.74 | 0.5% | 0.01 | `worst case for radix tree`
|
|
|
|
## Radix tree (this implementation)
|
|
|
|
| ns/op | op/s | err% | total | benchmark
|
|
|--------------------:|--------------------:|--------:|----------:|:----------
|
|
| 19.60 | 51,025,020.51 | 0.1% | 0.01 | `point reads`
|
|
| 55.62 | 17,980,734.93 | 0.7% | 0.01 | `prefix reads`
|
|
| 174.86 | 5,718,896.02 | 0.4% | 0.01 | `range reads`
|
|
| 28.27 | 35,372,166.39 | 0.1% | 0.01 | `point writes`
|
|
| 43.85 | 22,804,171.49 | 0.5% | 0.01 | `prefix writes`
|
|
| 49.59 | 20,165,355.92 | 0.9% | 0.01 | `range writes`
|
|
| 92.04 | 10,864,732.33 | 3.6% | 0.01 | `monotonic increasing point writes`
|
|
| 6,937.00 | 144,154.53 | 0.2% | 0.01 | `worst case for radix tree`
|
|
|
|
# "Real data" test
|
|
|
|
Point queries only, best of three runs. Gc ratio is the ratio of time spent doing garbage collection to time spent adding writes or doing garbage collection. Lower is better.
|
|
|
|
## skip list
|
|
|
|
```
|
|
Check: 11.3385 seconds, 329.718 MB/s, Add: 5.35612 seconds, 131.072 MB/s, Gc ratio: 45.7173%
|
|
```
|
|
|
|
## radix tree
|
|
|
|
```
|
|
Check: 2.48583 seconds, 1503.93 MB/s, Add: 2.12768 seconds, 329.954 MB/s, Gc ratio: 41.7943%
|
|
```
|
|
|
|
## hash table
|
|
|
|
(The hash table implementation doesn't work on range queries, and its purpose is to provide an idea of how fast point queries can be)
|
|
|
|
```
|
|
Check: 1.83386 seconds, 2038.6 MB/s, Add: 0.601411 seconds, 1167.32 MB/s, Gc ratio: 48.9776%
|
|
```
|