| name | 0.2.4-understand-cache_alignment |
| description | [0.2.4] Placement of data structures on memory boundaries matching cache line size, typically 64 bytes, preventing fal |
understand-cache_alignment
CALL NUMBER: ?.cache_alignment
DEFINITION: Placement of data structures on memory boundaries matching cache line size, typically 64 bytes, preventing false sharing between adjacent data.
Invoke this skill to understand cache_alignment down to its primitives. The RELATIVE ROOT below is the least-fixed-point closure of everything it bundles from — the full import cone, grouped by the lib each prim comes from. Projected from a prover-typed KB (MAP/SWI-Prolog consistency gate): every reference below resolves.
THE RELATIVE ROOT (the import cone, by lib)
CONSUMERS (what needs this)
mcs_lock_qnode
Projected from the concurrency synchronization primitives and memory models KB (155 concepts / 137 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.
(leaf — this is an actual skill.)
