Distributed task scheduling method based on directed acyclic

The invention relates to a distributed task scheduling method based on directed acyclic, and the method comprises the following steps: S1, obtaining a first directed acyclic graph, splitting the first directed acyclic graph into a second directed acyclic graph, and distributing the second directed acyclic graph to different abstract scheduling pools; s2, selecting a leader node among the scheduling nodes; s3, the scheduling node registers own information to the leader node; s4, averagely distributing the abstract scheduling pool to the registered scheduling nodes; s5, the leader node redistributes the second directed acyclic graph corresponding to the non-survived abstract scheduling pool; s6, sending a heartbeat packet to the scheduling node to maintain the own registration state; s7, analyzing the second directed acyclic graph corresponding to the second directed acyclic graph into a task, and allocating the task to the registered execution node; and S8, the registered execution node executes the distribute