{'fraction_non_alphanumeric': 0.02982848620432513, 'fraction_numerical': 0.0007457121551081282, 'mean_word_length': 4.885964912280702, '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}}
The Evaluation of Data Distributions for Multi-Dimensional Sparse Arrays Based on the EKMR Scheme

In our previous work, we have studied the performance of 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 multi-dimensional arrays can also be represented by the extended Karnaugh map representation (EKMR) scheme, in this paper, we first apply the SFC, the CFS, and the ED schemes for multi-dimensional sparse arrays based on the EKMR scheme. Then, we compare the performance of these three schemes based on the EKMR scheme with those based on the TMR scheme. Both theoretical analysis and experimental test were conducted. In theoretical analysis, we analyze the SFC, the CFS, and the ED schemes based on the TMR and the EKMR schemes in terms of the data distribution time and the data compression time. In experimental test, we implemented these three schemes based on the TMR and the EKMR schemes on an IBM SP2 parallel machine. From the experimental results, the ED scheme outperforms the CFS scheme that outperforms the SFC scheme for most of test sparse arrays. The SFC, the CFS, and the ED schemes based on the EKMR scheme outperform those based on the TMR scheme, respectively.