multichase
btree
| multichase | btree | |
|---|---|---|
| 2 | 2 | |
| 90 | 2 | |
| - | - | |
| 4.4 | 2.6 | |
| about 2 months ago | almost 3 years ago | |
| C | Python | |
| Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
multichase
-
In Defense of Linked Lists
I have some experience writing/modifying linked-list benchmarks (https://github.com/google/multichase) specifically to test memory latency.
It is extremely difficult, maybe impossible, to design a prefetcher that can predict the next cacheline(s) to prefetch in a linked-list. I am not aware of a single CPU that can do this consistently.
- Measuring core-to-core latency (in Rust)
btree
-
In Defense of Linked Lists
For a simple and readable implementation of a Python btree see this:
https://github.com/samsquire/btree
I tried to keep the implementation as simple as I could.
-
B-Trees: More Than I Thought I'd Want to Know
Btrees can be really simple, I've written a super simple understandable readable btree here.
https://github.com/samsquire/btree
It doesn't balance laterally like some B+ btrees do but it handles splits in a really simple way.
What are some alternatives?
core-to-core-latency - Measures the latency between CPU cores
bplustree - An on-disk B+tree for Python 3
c2clat - A tool to measure CPU core to core latency
re2j - linear time regular expression matching in Java
Taren - Useful C++ templates
learndb-py - Learn database internals by implementing it from scratch.
vmcontainer - Virtual memory based containers
glibc - Unofficial mirror of sourceware glibc repository. Updated daily.
jdk7u-jdk
libcxx - Project moved to: https://github.com/llvm/llvm-project