1. A method of analyzing intrinsic parallelism of an algorithm, comprising: generating a dataflow graph which is composed of vertexes representing computation and directed edges denoting the dependency and flow of data from the algorithm; building a matrix representing the dataflow graph; quantifying the intrinsic parallelism based on rank and dimension of the matrix representing the dataflow trace graph; and wherein a degree of the intrinsic parallelism is equal to a number of vertexes minus a rank of the matrix.