The task data flow graph(DFG) was partitioned into several sub-modules under hardware resource constraint.
在可重构硬件资源约束条件下，将任务的数据流图划分成数个子模块。
After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.
通过分析在数据流图(DFG)关键路径上生成PODCM的条件，给出了在DF G关键路径上生成PODCM的算法并建立了PODCM库。
After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.
通过分析在数据流图(DFG)关键路径上生成PODCM的条件，给出了在DF G关键路径上生成PODCM的算法并建立了PODCM库。
应用推荐