An Imprecise Computation-Rotational Scheduling Algorithm in Multiprocessor Real-Time System
Huining Wang · Journal of Shenyang Jianzhu University · 2008
In this paper,an imprecise computation-rotational scheduling algorithm for the tasks in multiprocessor real-time system which have timing and fault-tolerant constraints is researched,by which,in the presence of hardware component failures in hard real-time system,tasks still can be executed in their deadline,and the system cannot have disastrous results.Imprecise computation model was introduced to rotational scheduling algorithm.The analysis of simulative experiment illustrates that the imprecise computation-rotational scheduling algorithm has lower ratio of task refuse,and gets better utilization of system resources.The schedule theorem of rotational scheduling algorithm is improved,and the primary and backup execution time may overlap each other.The new algorithm enhances the schedulbility of tasks;the load of system is balanceable,and the search time of the system is reduced.