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

Figure CN115729648B_ABST