In order to predict more accurately whether the primary version of the fault-tolerant scheduling algorithm in software fault-tolerant model is executable

a new algorithm namedprediction-table based algorithm(PTBA)is put forward

in which the executing situation of tasks between the current time and the notification time of alternate version is fully considered. The executing situation of primary version is accurately predicted according to the sequence of notification time in that time interval

and the prediction table is created for the primary version to be executed. If primary versions do not fail

the task scheduling will be carried out based on the table. Simulation result shows that PTBA can acquire more execution time of the primary version and decrease CPU cost. PTBA is applicable for the circumstance with low software fault rate

especially for short-period tasks.