Operator scheduling method, device and system based on directed acyclic graph

By adopting an operator scheduling method based on directed acyclic graphs, fine-grained scheduling of operators is achieved, which solves the problems of inflexible scheduling and insufficient locality utilization in the existing technology and improves the performance of computation graph programs.

CN115729648BActive Publication Date: 2026-06-30STREAM COMPUTING INC

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
STREAM COMPUTING INC
Filing Date
2021-08-26
Publication Date
2026-06-30

AI Technical Summary

Technical Problem

Existing DAG scheduling techniques have shortcomings in fine-grained scheduling and user control, cannot fully utilize the data locality in operator computation logic, and the compiler needs to constantly adapt to new operator fusion modes, resulting in limited generalization ability.

Method used

This paper presents an operator scheduling method based on directed acyclic graphs. By receiving the directed acyclic graph input by the user, indexing operators, and using a preprocessing interface to receive call parameters for preprocessing such as grouping, scheduling subgraph partitioning, subgraph splitting, and merging, fine-grained scheduling is achieved.

Benefits of technology

It improves the flexibility and fine granularity of operator scheduling, makes full use of the computational power of the computational core, reduces the data transfer process, and improves the locality and performance of the computation graph program.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115729648B_ABST
    Figure CN115729648B_ABST
Patent Text Reader

Abstract

This disclosure relates to the field of computer technology and discloses a method, apparatus, and system for operator scheduling based on a directed acyclic graph (DAG). The DAG is formed based on multiple operators and data flows between the multiple operators. The method includes: receiving a DAG to be processed input by a user, and indexing the corresponding operators according to the DAG; receiving preprocessing interface call parameters input by the user based on a preprocessing interface to preprocess the corresponding operators; and scheduling the corresponding operators according to the preprocessing results. This disclosure enables more flexible and fine-grained operator scheduling when scheduling operators in a DAG, based on the user's fine-grained processing requirements. It indexes the operators to be scheduled from the user-input DAG, preprocesses the indexed operators using a preprocessing interface, and schedules the operators according to the preprocessing results.
Need to check novelty before this filing date? Find Prior Art