Aiming at the features of Fork task graphs, proposes a scheduling algorithm based on task duplication. On the basis of introducing algorithm base, nomenclature, the new scheduling algorithm of Fork task graph –NSF, the examples are used to analyze and compare to the scheduling. The algorithm ensures the optimal scheduling length and reduces the number of used processors. Experiment results show that the proposed algorithm has better comprehensive performance than other algorithms.