{'fraction_non_alphanumeric': 0.01662049861495845, 'fraction_numerical': 0.0, 'mean_word_length': 5.398230088495575, '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}}
An Array Assignment Method for Parallel Computing Systems

In parallel computing systems, a crucial factor that can limit parallelism is the distribution of operands, which usually are vectors, matrices or higher dimensional arrays, among parallel memory modules. In this paper, we introduce a method of assignment of high dimensional arrays, which include vectors and matrices as special cases, to parallel memory modules of parallel computing systems. Our analysis shows that the method achieves maximum parallelism for a very high percentage of array operations. We have derived the exact conditions under which optimality is achieved. Also provided are the worst and average case bounds on array operation performance.