Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.
-
Updated
Apr 1, 2026 - Rust
Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.
Demonstration of how cache coherence reduce performance of a parallel program and how to overcome them.
Introduction to cache coherence: false sharing, MESI protocol and vectorization
Repository of the lab3 assignment for the Parallel Programming course.
Wait-free SPSC ring buffer in C++17 — alignas(64) cache-line padding, TSan-verified 50M ops, 3.1x mutex throughput, sub-350ns p99 latency
experimenting with a cache-line friendly BST idea in Rust
A wrapper onto arrays of value types to be represented as cache lines.
Add a description, image, and links to the cache-line topic page so that developers can more easily learn about it.
To associate your repository with the cache-line topic, visit your repo's landing page and select "manage topics."