{'fraction_non_alphanumeric': 0.0189873417721519, 'fraction_numerical': 0.0, 'mean_word_length': 5.459183673469388, '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}}
Evaluation of Dynamic Data Distributions on NUMA Shared Memory Multiprocessors

Dynamic data distributions offer a number of performance benefits, but require more sophisticated compiler support and incur run-time overhead. We investigate attainable benefits using a compiler system we developed for the Hector NUMA multiprocessor. We show that the benefits depend on a number of factors, including data size relative to the cache size, data access patterns, the degree of “NUMAness” of the multiprocessor system, and the extent to which data is reused. Programmers and compiler designers must take these factors into consideration.