{'fraction_non_alphanumeric': 0.020437956204379562, 'fraction_numerical': 0.0, 'mean_word_length': 5.376744186046512, '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}}
Task Scheduling Algorithm with Fault Tolerance for Cloud

Cloud computing is a paradigm that focuses on sharing of data and computation over a scalable network of nodes like end users, computers, data centers, and web services. Task scheduling is one of the most famous combinatorial optimization problems, and plays a key role to improve the performance of flexible and reliable systems. Cloud-based application services like social networking, web hosting, and content delivery, deal with large amount of data processing. These applications require large amount of network bandwidth because traffics between nodes are tremendous. As network bandwidth is a limited resource, scheduling policies that reduce bandwidth usage is essential in cloud computing. Task scheduling algorithms based on data locality will reduce the network access, thus reducing bandwidth usage and the job completion time. Balance Reduce Algorithm (BAR) is a heuristic algorithm based on data locality, and minimizes make span (job completion time) of a job. This paper proposes an improved balance reduce algorithm, an enhancement of BAR algorithm for handling machine failure. For this purpose, we propose an algorithm which is similar to primary backup approach. Compared to existing BAR algorithm, this proposed algorithm will reduce the job completion time effectively when failure happens.