A method for analyzing the internal parallelism of the algorithm, vertices and generating a data flow graph consisting of indicating a corner direction in dependence of the flow and the data from the algorithm to express the calculation; Step to create a matrix representing the data flow graph; And including the step of quantifying the inner parallelism based on the dimensions and the rank of the matrix representing the data flow graph.

title = "METHOD OF ANALYZING INTRINSIC PARALLELISM OF ALGORITHM",

abstract = "A method for analyzing the internal parallelism of the algorithm, vertices and generating a data flow graph consisting of indicating a corner direction in dependence of the flow and the data from the algorithm to express the calculation; Step to create a matrix representing the data flow graph; And including the step of quantifying the inner parallelism based on the dimensions and the rank of the matrix representing the data flow graph.",

T1 - METHOD OF ANALYZING INTRINSIC PARALLELISM OF ALGORITHM

AU - Lee, Gwo-Giun

PY - 1800

Y1 - 1800

N2 - A method for analyzing the internal parallelism of the algorithm, vertices and generating a data flow graph consisting of indicating a corner direction in dependence of the flow and the data from the algorithm to express the calculation; Step to create a matrix representing the data flow graph; And including the step of quantifying the inner parallelism based on the dimensions and the rank of the matrix representing the data flow graph.

AB - A method for analyzing the internal parallelism of the algorithm, vertices and generating a data flow graph consisting of indicating a corner direction in dependence of the flow and the data from the algorithm to express the calculation; Step to create a matrix representing the data flow graph; And including the step of quantifying the inner parallelism based on the dimensions and the rank of the matrix representing the data flow graph.