{'fraction_non_alphanumeric': 0.015097690941385435, 'fraction_numerical': 0.0, 'mean_word_length': 5.226519337016574, '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 Parallelized Dynamic Task Scheduling for Batch of Task in a computational grid

ABSTRACT The emerging computational grid (CG) system is used for effective utilization of geographically dispersed computing resources in order to fulfill the compute-intensive requirement of the users. Mapping and scheduling of a Batch of Task (BoT) on CG resources have been proved to be NP-complete. In this paper, we propose a Parallelized Dynamic Task Scheduling (PDTS) approach for BoT to minimize job completion time and improving resource utilization by enhancing task level parallelism. The algorithm works in two phases; the first phase divides the task into subtasks to exploit parallelism while in the second phase when the task is available in the memory for execution, it allocates it to the most suitable and available resources dynamically. A simulation study has been carried out to evaluate PDTS by comparing with other heuristic approaches with similar objectives by using the GridSim toolkit. The obtained empirical results show that PDTS outperforms than other considered scheduling strategies in all the cases under study.