{'fraction_non_alphanumeric': 0.007361963190184049, 'fraction_numerical': 0.0, 'mean_word_length': 5.476190476190476, '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}}
Applying the list method to the transformation of parallel algorithms into account temporal characteristics of operations

A program that is working inefficiently leads to inevitable losses in computer performance. These losses should be avoided or at least minimized. In order to do this we need to apply the approved research and development techniques and also equivalent algorithm conversions. In the present paper we suggest a technique of parallel algorithm modification with the aim of improving its efficiency due to balanced load of processors. The technique itself consists in rearranging processes among processors and enlargement of algorithm operations. All information dependencies of an algorithm are preserved and algorithm performance time and the number of processors involved can only be reduced.