Array Data Dependence Testing with the Chains of Recurrences Algebra
作者： R.A. van Engelen , J. Birch , K.A. Gallivan
关键词:
摘要: This paper presents a new approach to dependence testing in the presence of nonlinear and non-closed array index expressions pointer references. The chains recurrences formalism algebra is used analyze recurrence relations induction variables, for constructing forms We use these determine if references are free dependences loop nest. Our formulation enhances accuracy standard algorithms such as extreme value test range test. Because easily converted closed (when they exist), variable substitution recovery can be delayed until after analyzed
fsu.edu 参考文章(54)
Paul Howard Havlak, Ken Kennedy, Interprocedural symbolic analysis Rice University. ,(1995)
Olaf Bachmann, Chains of recurrences Kent State University. ,(1997)
Kyle Gallivan, Robert van Engelen, Tight Timing Estimation With the Newton-Gregory Formulae∗ ,(2002)
Mohammad R. Haghighat, Aart J. C. Bik, Milind Girkar, Incorporating Intel MMX technology into a Java JIT compiler. Scientific Programming. ,vol. 7, pp. 167- 184 ,(1999)
Kyle Gallivan, Johnnie Birch, Robert van Engelen, Value Range Analysis of Conditionally Updated Variables and Pointers ,(2004)
Pen Chung Yew, Zhiyu Shen, Zhiyuan Li, An Empirical Study on Array Subscripts and Data Dependencies. international conference on parallel processing. ,vol. 2, pp. 145- 152 ,(1989)
Aart Johannes Casimir Bik, The software vectorization handbook ,(2004)
Konstantinos Kyriakopoulos, Kleanthis Psarris, Measuring the Accuracy and Efficiency of the Data Dependence Tests. ISCA PDCS. pp. 211- 218 ,(2001)
Lawrence Rauchwerger, Jay Hoeflinger, Ramon Doallo, John Grout, Yunheung Paek, Peng Tu, Bill Pottenger, Rudolf Eigenmann, Thomas Lawrence, David Padua, William Blume, Jaejin Lee, Advanced Program Restructuring for High-Performance Computers with Polaris ,(2000)
Ravi Sethi, Jeffrey D. Ullman, Alfred V. Aho, Compilers: Principles, Techniques, and Tools ,(1986)