Vectorization beyond data dependences
Peiyi Tang, Nianshu Gao · 1995
: Data dependences between statements have long been used for detecting parallelism and converting sequential programs into parallel forms. Almost all existing automatic parallelization and vectorization schemes are based on enforcing original data dependences detected in programs. In this paper, we extend the traditional vectorization algorithm to reverse some data dependences involved in multiple-statement reductions for more parallelism. The extended algorithm can vectorize multiple-statement reductions in programs and generate more and thicker vector statements than the traditional algorithm. This extended algorithm can be used to enhance all existing vectorizing compilers for supercomputers. 1 Introduction Data dependences between statements have long been used by vectorizing and parallelizing compilers to de- This work was supported in part by the Australian Research Council under Grant No. A49232251. y Part of the work was done when this author was at the Australian Nation...