{'fraction_non_alphanumeric': 0.016381236038719285, 'fraction_numerical': 0.0, 'mean_word_length': 6.036649214659686, '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}}
Performance Implications of Synchronization Support for Parallel Fortran Programs

This paper studies the performance implications of architectural synchronization support for automatically parallelized numerical programs. As the basis for this work, the authors analyze the needs for synchronization in automatically parallelized numerical programs. The needs are due to task management, loop scheduling, barriers, and data dependency handling. They present synchronization algorithms for efficient execution of programs with nested parallel loops. Next, they identify how various hardware synchronization primitives can be used to satisfy these software synchronization needs. The synchronization primitives studied are test and set, fetch and add, exchange-byte and synchronization bus implementation of lock/unlock operations. Lastly, they ran experiments to quantify the impact of various architectural support on the performance of a bus-based shared memory multiprocessor running automatically parallelized numerical programs. They found that supporting an atomic fetch and add primitive in shared memory is as effective as supporting lock/unlock operations with a synchronization bus. Both achieve substantial performance improvement over the cases where atomic test and set and exchange-byte operations are supported in shared memory.