Dependent task scheduling algorithm in distributed system

In order to improve the performance of tasks with dependencies in distributed environment and to overcome the shortcomings of existing table scheduling algorithms, the idea of table scheduling and task replication is combined to propose a heuristic task based on critical path and task replication Scheduling Algorithm (HCPTD). The algorithm improves the calculation method of task weight, and obtains the scheduling sequence according to whether it is the mission-critical or descending order of weight. The processor chooses the earliest task completion time and the shortest task-to-exit node distance. Experimental results show that HCPTD effectively improves the scheduling performance of distributed systems.