{'fraction_non_alphanumeric': 0.00975609756097561, 'fraction_numerical': 0.0, 'mean_word_length': 5.172932330827067, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Combination of Scalable Caching Methods for Weakly Coherent Shared Memory Model

This paper describes highly scalable caching methods for a weakly coherent shared memory model called WPRAM in which explicit synchro-nisation 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. Results are based on a simulation of a scalable distributed memory machine. An analytical model is used to describe the performance of the algorithm and verify the simulation results.