We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
This is a program that I wrote to be able to determine programmatically the memory hierarchy of a machine.
It’s based on an exercise in Hennesy & Patterson which is itself based on the thesis work of Saavedra.
It generates pretty graphs from which you can infer a bunch of information like cacheline size, sizes of caches, associativity, and more.