{'fraction_non_alphanumeric': 0.023255813953488372, 'fraction_numerical': 0.0016611295681063123, 'mean_word_length': 5.153061224489796, '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}}
A parallel implementation of GESPP on a cluster of Silicon Graphics workstations

In this paper, we develop and evaluate a parallel algorithm for GESPP on a cluster of Silicon Graphics workstations using PVM as a parallel programming environment. The proposed algorithm reduces the computation time to O(n/sup 3/ / p) and the communication time to O(n) including scaling, searching for the pivot element, row interchanging, and pivot row and multipliers column broadcasting. The numerical experiments show that the proposed parallel algorithm offers a high speedup and efficiency for the test problems.