Combination of Scalable Caching Methods for Weakly Coherent Shared Memory Model
Kamran Zamanifar, J. M. Nash, Peter M. Dew · 2001
This paper describes highly scalable caching methods for a weakly coherent shared memory model called WPRAM in which explicit synchronisation operations are used to guarantee data coherency. The schemes described here apply to barrier synchronisation and a form of pairwise synchronisation employed by the WPRAM, and the combination of the two. An example of the use of barrier caching method is shown using the simplex method for linear programming. A parallel sorting algorithm is used to demonstrate the combination of barrier and tag caching schemes.