Hard real-time fault-tolerant scheduling algorithm based on minor version status

Abstract:
With the increase in application complexity, multi-core systems are increasingly being used in real-time systems. However, as the number of processors increases, the probability of failure also increases. As a result, many fault-tolerant real-time scheduling algorithms have been proposed. The traditional fault-tolerant method adopts the technology of primary and secondary version, in which the secondary version has two states: active and passive. The active sub version runs entirely on the processor, while the passive sub version is allocated to different processors, thereby increasing resource consumption. On this basis, an improved sub-version state algorithm ISVSA (improved sub-version state algorithm) is proposed, which reduces the redundancy of the sub-version and saves processor consumption by dividing the time of the active sub-version and overlapping the active sub-version. At the same time, the number of processors is reduced, and finally through simulation experiments, the schedulability of the algorithm is proved.