{'fraction_non_alphanumeric': 0.012232415902140673, 'fraction_numerical': 0.0, 'mean_word_length': 4.810650887573964, '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 different approach for allocating tasks in a DCS using A

In a distributed computing systems (DCS) tasks may consist of multiple modules. Tasks submitted to a DCS, are usually partitioned into different modules and the modules may be allocated to different processing nodes so as to achieve minimum turn around time of the tasks utilizing the maximum resources of the existing system such as CPU speed, memory capacities etc. The problem lies on how to obtain the optimal allocation of these multiple tasks by keeping in mind that no processing node is overloaded due to this allocation. We propose an algorithm A*RS using well-known A* which aims to reduce the search space and time for allocating the tasks by minimizing the turn around time of tasks in the way so that processing nodes do not become overloaded due to this allocation. Our experimental results justify the claims with necessary supports by comparing it with the earlier algorithm for multiple tasks allocation.