Dependence Difference Inequality Test Algorithm for Two-dimensional Arrays in Software Pipelining Field

This paper presents a new dependence difference inequality test algorithm for two-dimensional arrays,and proves that the time complexity of the algorithm is polynomial.Compared with directly solving algorithms,the time complexity of the dependence difference inequality test algorithm is much better than those of other algorithms.Experimental results also show that the dependence difference inequality test algorithm works well for most of data dependencies appeared in scientific computation programs.