A micro-dispatching method supporting directed cyclic graph
A directed ring graph and scheduling method technology, applied in program control design, instrumentation, electrical and digital data processing, etc., can solve the problems of reducing compilation and optimization performance, reducing compilation efficiency, and reducing running time, and improving compilation and optimization performance. , the effect of improving the efficiency of parallel compilation and reducing the possibility
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0070] As mentioned above, modular scheduling belongs to the Move-then-scheduling technology, which is a movement instruction across the back-edge of the loop. The "Data Dependence Graph" (DDG: Data Dependence Graph) it builds is different from the traditional " Directed Acyclic Graph" (DAG: Directed Acyclic Graph), but a "Directed Cyclic Graph" (DCG: Directed Cyclic Graph).
[0071] It not only includes the dependencies between instructions of the same iteration (iteration) in the loop, but also includes the loop-carried dependencies between different iterations. It is the latter, by looping back to the edge (if every path from the initial node of the DDG to node a goes through node b, then node b is said to dominate node a (b dom a). If b dom a, then the edge a → b is called "back edge". As shown in Figure 1c, node 1 points to its own back edge), turning the traditional DAG into a "directed and cyclic graph" [Vicki H.Allan, Reese B. Jones, Randall M . Lee, Stephen J. Allan....
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 