A software pipelining method

We introduce complete data dependence graph CDG, directed edges in the graph represent dependences between instructions in loop, also introduce the notation of base set ,a base set which is parallel expendable can cover the whole instructions in loop, this paper employ a genetic algorithm to search for the optimal solution of base set. This method can handle any possible data dependence, so it can high parallel the loops.

[1]  Leonard J. Bass,et al.  Classifying architectural elements as a foundation for mechanism matching , 1997, Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97).