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

A technology of optimal path and scheduling method, applied in multi-program device, program start/switch, resource allocation, etc., can solve the problem of wasting system resources, long scheduling period, and unable to fully utilize the parallel advantages of multi-core processors and distributed environments and other problems, to achieve the effect of utilizing system resources, sufficient system resources, and shortening the running time of scheduling

Active Publication Date: 2014-12-24
NEUSOFT CORP
View PDF6 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device
  • DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device
  • DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more embodiments. It may be evident, however, that these embodiments may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments.

[0033] Aiming at the problems of high complexity, long running time and low system operation efficiency in the DAG graph splitting method in the existing multi-model scheduling method, the present invention proposes a multi-model parallel scheduling solution based on the optimal path of DAG nodes. The optimal path analysis algorithm for path detection splits the DAG graph into parallel-schedulable sequences, then stores the parallel-schedulable sequences in the form of adjacency matrix, maps the adjacency matrix into an adjacency list, and finally converts th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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 ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/48G06F9/50
Inventor 徐丽丽张骞赵广斌张珠华
Owner NEUSOFT CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products