In this paper, a general method is put forward to process the induction scalars in paralleling compiler. This method changes the processing of induction scalars to the solving of difference equations and uses Z transformation and inverse Z transformation to solve equations. It improves the paralleling compiler's ability to process the inductive scalars, which is helpful to the automatic parallelization of serial programs.
[1]Padua David A, Wolfe Michael. Advanced compiler optimizations for supercomputers. Communications ACM, 1986,29(12):1184~1202
[2]Pottenger B, Eigenmann R. Idiom recognition in the Polaris parallelizing compiler. In: Wolfe M ed. Proceedings of the International Conference'95 on Supercomputing. New York: ACM Press, 1995. 444~448
[3]Lovaglia Anthony R, Preston Gerald C. Foundations of Algebra and Analysis. New York and London: Harper & Row Publishers, 1966
[4]Reid J Gary. Linear System Fundamentals, Continuous and Discrete, Classic and Modern. New York: McGraw-Hill Book Company, 1983
[5]Wolfe Michael. High Performance Compilers for Parallel Computing. New York and London: Addison-Wesley Publishing Company, Inc. 1996
[6]Allen John R, Kennedy Ken. Automatic translation of Fortran programs to vector form. ACM Transactions on Programming Languages and Systems, 1987,9(4):491~542