{'fraction_non_alphanumeric': 0.01740294511378849, 'fraction_numerical': 0.0, 'mean_word_length': 5.285714285714286, '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 Fault-Tolerant Distributed Solution for the Parallel Gaussian Reduction of Huge Arrays

Solving a linear system of equations is a common task performed for most of the scientific experiments. Everyday, these applications increase their demands, pushing the computational capacity to the limits. At a certain point, our systems, running common algorithms, become unable to process such massive amounts of information. The paper analyses and modifies the standard Gaussian reduction so that a huge array may be handled by almost any distributed system. Moreover, the paper focuses on providing a decent level of fault tolerance in order to comply with a real, heterogeneous distributed system and on becoming a solution for sensitive applications.