I found the easiest way to think about it, when we were doing caches in computer architecture was to think of it in terms of abstraction. The CPUs have "read m

I found the easiest way to think about it, when we were doing caches in computer architecture was to think of it in terms of abstraction. The CPUs have "read memory" and "write memory" as the only operations programs can see. The cache policies operate asynchronously (because multiple cores simultaneously executing), to make those happen in the fastest way possible. There's an endless variety of schemes and ways to design it, with the one huge requirement that it must ALWAYS be accurate. But as long as you can satisfy that, you can do some goofy, crazy stuff. Might be faster, might be slower, but it will work.