Research on Fault-tolerant Scheduling of Precedent Tasks Based on Primary/Backup and Culture Algorithm

摘要

In order to ensure the reliability of distributed system with precedent constraint tasks, it is necessary to provide certain redundancy strategy to ensure that real-time critical tasks can be completed before the deadline even after system failure. In this paper, based on the culture algorithm of greedy random process for multi task scheduling with precedent constraints, the fault-tolerant scheduling algorithm is studied. This paper mainly designs three scheduling methods based on fault-tolerant technology of primary/backup, respectively implements the fusion algorithm of primary/backup and culture algorithm, and compares the effectiveness and CPU utilization of the three scheduling algorithms.