{'fraction_non_alphanumeric': 0.014462809917355372, 'fraction_numerical': 0.0, 'mean_word_length': 4.914634146341464, '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}}
Concurrent implementation of linear and nonlinear programming

This paper presents the results of an example of a single-criterion problem which can be a link to a bigger decision making chain. Load balancing is the key issue for high performance of a parallel implementation of the problem. Due to its importance, load balancing is a well-studied problem in parallel and distributed systems in general. We would like to present three strategies that significantly reduce the runtime.