{'fraction_non_alphanumeric': 0.03111495246326707, 'fraction_numerical': 0.000864304235090752, 'mean_word_length': 5.0, '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 evaluation of data distributions with load-balancing for sparse arrays

In our previous work, we have studied three data distribution schemes, Send Followed Compress (SFC), Compress Followed Send (CFS), and Encoding- Decoding (ED), for sparse arrays based on the traditional matrix representation (TMR) scheme. Since multidimensional arrays can also be represented by the extended Karnaugh map representation (EKMR) scheme, in this paper, we first apply the SFC/CFS/ED schemes based on the EKMR scheme. Then, we compare the performance of these three schemes with those based on the TMR scheme. Both theoretical analysis and experimental test were conducted. In theoretical analysis, we analyze the SFC/CFS/ED schemes based on the TMR/EKMR schemes in terms of the data distribution time and the data compression time. In experimental test, we implement these three schemes on an IBM SP2 parallel machine. The theoretical analysis and experimental results first show that the ED scheme is superior to the CFS scheme that is superior to the SFC scheme. Second, these three schemes based on the EKMR scheme outperform those based on the TMR scheme.