A new and better DTSA (dependable task scheduling algorithm) for distributed real-time system

Aim. The introduction of the full paper discusses what we believe to be the shortcomings of a number of papers in the open literature about real-time scheduling algorithms and then, in its last paragraph, proposes what we believe to be a new and better DTSA, which is explained in sections 1 and 2. Section 1 gives a dependable scheduling model which considers both reliability and security and is suitable for the distributed real-time system that has high requirements for dependability. Section 2 proposes our improved DTSA which combines fault-tolerant technology with information security technology; it uses the improved backup copy technology to effectively assign and schedule real-time tasks among many processors, thus enhancing the utilization of CPU resources. It also supports to handle hardware failure and software failure. Specially, it prevents these malice tasks from running on processor by checking its identify before running. Section 3 simulates our DTSA; the simulation results, presented in Figs. 1, and their analysis show preliminarily that, compared with other algorithms, our DSTA can obtain higher performance with little cost in hardware, thus having better dependability.