Search Results for "chasing"

...By timing tight loops and varying parameters, the program reveals step-changes in latency that map to cache lines, page sizes, and TLB coverage. It is intentionally minimal so you can modify page sizes, strides, or pointer-chasing strategies to run experiments on different machines and kernels. The code is useful for teaching, hardware bring-up, or validating assumptions about huge pages and NUMA placement. Rather than providing a plotting framework, it prints timings that you can collect and graph with external tools to visualize cache/TLB boundaries.

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...