{'fraction_non_alphanumeric': 0.019319227230910764, 'fraction_numerical': 0.0, 'mean_word_length': 5.593939393939394, '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 a cost effective hybrid approach to task scheduling and matching for computational grids

To utilize computational grids more efficaciously, directed acyclic graph (DAG)-based approach is required. This paper falls into the context of applying cost effective approach to DAG scheduling to lower down the overall program completion time. The proposed algorithm, namely, Cost-effective Hybrid approach (CEHA), coalesces the foredeals of cuckoo search and ant colony optimization. Experimental analysis depicted the expeditious converging property of cuckoo search algorithm exploiting it to find sub-optimal solution which drives ACO to more optimized solution. CEHA finds the order of all tasks to be scheduled in a parallel program and then allocates these tasks to the most appropriate processing elements in a computational grid finally minimizing the total completion time of the parallel program. Simulations demonstrated that the proposed CEHA outperforms sundry algorithms like N. Moganarangan et al. method, Ant colony optimization algorithm, and Cuckoo search algorithm.