DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device

Abstract

The invention provides a DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device. The method comprises the following steps of creating a DAG based on a relationship among models according to the relationship among the models; decomposing the DAG into a scheduling sequence set according to a path detection-based optimal path analysis algorithm, wherein the scheduling sequence set comprises a plurality of parallel scheduling sequences; saving all parallel scheduling sequences in the scheduling sequence set as a first adjacency matrix; mapping the first adjacency matrix into an adjacency list; running each sequence in the scheduling sequence set in parallel according to the adjacency list. According to the DAG node optimal path-based multi-model parallel scheduling method and device provided by the invention, the problems that the complexity is high and the running time is long in the existing decomposing method can be solved; the system resources can be fully utilized, and the multi-model scheduling running time is effectively shortened.

Description

technical field [0001] The present invention relates to the technical field of model scheduling, and more specifically, to a multi-model parallel scheduling method and device based on the optimal path of DAG nodes. Background technique [0002] The design and operation of complex products often involve multiple interrelated models of different types and complexities. The scheduling method of multiple models directly affects the feasibility and timeliness of product operation. The multi-model scheduling method mainly uses a DAG graph (Directed Acyclic Graph) to describe the predecessor-successor relationship between models. In the DAG graph, the nodes of the DAG represent the models, and the edges of the DAG represent the dependencies between the models. [0003] figure 1 is the DAG graph of the model system, by figure 1 It can be seen that the DAG diagram describes multiple models and their interdependencies. Among them, the data on the left side of the circle represents ...

AI Technical Summary

Problems solved by technology

[0007] In view of the above problems, the purpose of the present invention is to provide a multi-model parallel scheduling method and device based on the optimal path of DAG nodes, so as to solve the problem that in the existing multi-model parallel scheduling method, the scheduling cycle is long, and the multi-core processor and the multi-core processor cannot be fully utilized. Parallel advantages in a distributed environment, waste of system resources

Images