A cache miss is an access to a line that is not in a given level, which must then be fetched from the next level down. The working set of a piece of code over an interval is the set of lines it touches in that interval; the level whose capacity it fits in sets its speed.
bench_mem.py.Exemples
Example 3.3 (Geometry of a first-level cache)
A 48 KiB, 12-way cache with 64-byte lines has sets. The set index is bits 6 to 11; addresses that are equal modulo bytes fall into the same set. Thirteen hot structures placed at the same offset of thirteen 4 KiB pages cannot all stay in this cache, although together they occupy 832 bytes.