Research on a Scheduling Algorithm Based on Task Duplication
The problem of scheduling parallel program task s on network of work station is known to be NP complete.The scheduling algorithms are classified into two categories: one is to include task duplication;the other is non-task duplication.Drawbacks of the custom TDS algorithm were discussed and a modified TDS algorithm called as MTDS was presented.This algorithm was based on the characters of the HC and the dynamical DAG,which would shorten the makespan of the whole tasks;and also avoided that some certain tasks that were in one execution list occupy the computing resources too much time so as to delay execution time of the whole programs.