Association for Computing Machinery (ACM), ACM Transactions on Computer Systems, 4(7), p. 321-359, 1989
DOI: 10.1145/75104.75105
Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86
DOI: 10.1145/10590.10610
Full text: Download
The memory coherence problem in designing and implementing a shared virtual memory on loosely coupled multiprocessors is studied in depth. Two classes of algorithms, centralized and distributed, for solving the problem are presented. A prototype shared virtual memory on an Apollo ring based on these algorithms has been implemented. Both theoretical and practical results show that the memory coherence problem can indeed be solved efficiently on a loosely coupled multiprocessor.