A Scheduling Algorithm for Real-Time Distributed Embedded Systems
Dan Shan · Journal of Shenyang Jianzhu University · 2008
The scheduling algorithm for the tasks in distributed real-time embedded systems is presented in this paper.It makes the distributed real-time embedded systems satisfy the real-time constraints.Ncf+1 replicas of a task are scheduled on different processors,and the task which is in the critical path is scheduled first.we use the replicated method to improve the reliability of the system and to minimize the critical path length.,and to make the system tolerate Ncf component failures to the most extent.Through an example,we show that the new algorithm satisfies the real-time constraints and tolerates the failures of processors and communications links.