Date: 2019-08-30
Categories: btrees; filesystems; ocaml; programming; research; software

B-tree random write performance: 1M random writes on a full store in about 10s

I just added a write-back cache to the B-tree code. As expected, performance has greatly improved. Currently we get about 100k random writes /s on a reasonably full store. The animation below shows 12s, but this is probably because of slowdown caused by the screen recorder.

Animated gif:


Related posts: