{'fraction_non_alphanumeric': 0.011695906432748537, 'fraction_numerical': 0.0, 'mean_word_length': 5.119047619047619, '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}}
Parallel Approach to the Firefly Algorithm

Distributed computing is a computation approach in which many calculations are made at the same time in a distributed memory model, exploring the fact that big problems can sometimes be divided into little ones that can be solved at the same time. This paper uses the distributed computing concept to optimize the sequential version of the Firefly Algorithm (FA). Results show that the proposed distributed version is more efficient than the regular existing algorithm.