{'fraction_non_alphanumeric': 0.017843289371605897, 'fraction_numerical': 0.0, 'mean_word_length': 5.323529411764706, '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}}
Designing and Implementation of Failure-Aware Based Approach for Task Scheduling in Grid Computing

Grid computing makes large-scale computations easier to handle. In heterogeneous systems like grid computing, failure is inevitable. Because of the volume and diversity of the resources, scheduling algorithm is among the most difficult challenges to overcome in grid computing. To reduce the make-span of the job to be executed a thorough understanding of scheduling in grid is important. Say there are two computing nodes that aren't being used right now. The scheduler may choose the node that has higher computing strength (for example, higher CPU speed, higher free memory), even though this node may also have high potential of failure. High potential of failure refers to the possibility of the failure occurring at execution time, resulting in the decrease of system performance. Therefore, awareness of failure is also very important in scheduling. This work proposes and implements a failure-aware scheduling method to schedule the tasks which uses both performance factors and failure factors of resources while making scheduling decision. The proposed algorithm is analyzed over various performance matrices and it shows considerably improved performance over existing algorithm