multichase
Taren
| multichase | Taren | |
|---|---|---|
| 2 | 1 | |
| 90 | 14 | |
| - | - | |
| 4.4 | 7.3 | |
| about 2 months ago | 8 days ago | |
| C | C++ | |
| Apache License 2.0 | MIT License |
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)
Taren
What are some alternatives?
core-to-core-latency - Measures the latency between CPU cores
jdk7u-jdk
c2clat - A tool to measure CPU core to core latency
re2j - linear time regular expression matching in Java
libcxx - Project moved to: https://github.com/llvm/llvm-project
btree - a simple python btree
ocaml - The core OCaml system: compilers, runtime system, base libraries
vmcontainer - Virtual memory based containers
too-many-lists - Learn Rust by writing Entirely Too Many linked lists
glibc - Unofficial mirror of sourceware glibc repository. Updated daily.
OpenVDB - OpenVDB - Sparse volume data structure and tools