A lazy cache algorithm
Yehuda Afek, Gavin M. Brown, Michael Merritt · 1989
This paper examines cache consistency conditions (safety conditions) for multiprocessor shared memory systems.It states and motivates a weaker condition than is normally required.An algorithm is presented that exploits the weaker condition to achieve greater concurrency.The paper concludes with a proof that the algorithm satisfies the safety condition.