Displacement strategy for (Computer) Cache
Laszlo Belady's method of displacing the memory area that will not be accessed for the longest time is optimal

For you to know when something will be accessed in the future, you need to know when your program accesses which part of memory.
The author of the wikipedia article confuses this with knowledge of program flow, which is not the same thing (memory access locations / patterns is one of the things that arise from the program flow).