{'fraction_non_alphanumeric': 0.011164274322169059, 'fraction_numerical': 0.0, 'mean_word_length': 5.1568627450980395, '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}}
Efficient Implementation of high-level parallel programs

The efficiency of a parallel program is related to the implementation of its data structures on the distributed (or shared) memory of a specific architecture. This paper describes a declarative approach that may be used to modify the mapping of the program data on a specific architecture. The ideas are developed in the context of a new language called UC and its implementation on the Connection Machine. The paper aim contains measurements on sample programs to illustrate the effectiveness of data mappings in improving the execution efficiency of example programs.