{'fraction_non_alphanumeric': 0.00933125972006221, 'fraction_numerical': 0.0, 'mean_word_length': 4.962962962962963, '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}}
Solving System of Linear Equations in a Network of Workstations

In this article we propose an evaluation of the three common algorithms for solving linear system of equations: Gauss elimination, Gauss-Jordan without pivoting and Jacobi with dominant rows. The parallel design of the chosen algorithms is a compromise between the easies and elegant way to implement in MPI and the performance. The result confirmed that for a small number of low cost computers the speedup is acceptable for the Gauss elimination and Gauss-Jordan but for Jacobi with dominant rows if data is not already distributed it is better to implement the serial version