Eliminating false data dependences using the Omega test

ACM SIGPLAN Notices

Volumn 27, Issue 7, 1992, Pages 140-151

  Pugh, William ^a   Wonnacott, David ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; PROGRAM DEBUGGING;

FALSE DATA DEPENDENCIES; OMEGA TEST;

PROGRAM COMPILERS;

EID: 0026974538     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/143103.143129     Document Type: Article

References (20)

1. Vasanth Balasundaram and Ken Kennedy. A technique for summarizing data access and its use in parallelism enhancing transformations. In ACM SIGPLAN'89 Conference on Programming Language Design and Implementation, 1989.
2. W.W. Bledsoe. A new method for proving certain presburger formulas. In Advance Papers, 4th Int. Joint Conference on Artif. Intell., Tibilisi, Georgia, U.S.S.R, 1975.
3. Thomas Brandes. The importance of direct dependences for automatic parallelism. In Proc of 1988 International Conference on Supercomputing, July 1988.
4. D. Y. Cheng and D. M. Pase. An evaluation of automatic and interactive parallel programming tools. In Supercomputing ‘91, November 1991.
5. G.B. Dantzig and B.C. Eaves. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A), 14:288-297, 1973.
6. Thomas Gross and Peter Steenkiste. Structured dataflow analysis for arrays and its use in an optimizing compiler. Software-Practice and Experience, 20:133-155, February 1990.
7. M. W. Hall, T. Karvey, K. Kennedy, N. McIntosh, K.S. McKinley, J. D. Oldham, M. Paleczny, and G. Roth. Experiences from the parascope editor workshop. Technical Report RICE COMP TR91-173, Dept. of Computer Science, Rice University, September 1991.
8. Mohammand Reza Haghighat and Costantine D. Polychronopoulos. Symbolic dependence analysis for high-performance parallelizing compilers. In Advances in Languages and Compilers for Parallel Processing. The MIT Press, 1991.
9. Farnam Jahanian and Aloysius Ka-Lau Mok. A graph-theoretic approach for timing analysis and its implementation. IEEE Transactions on Computers, 1987.
10. David Klappholz, Kleanthis Psarris, and Xiangyun Kong. On the perfect accuracy of an approximate subscript analysis test. In Supercomputing ‘90, November 1990.
11. David Levine, David Callahan, and Jack Dongarra. A comparative study of automatic vectorizing compilers. Technical Report MCS-P218-0391, Argonne National Laboratory, April 1991.
12. Kathryn S. McKinley. Dependence analysis of arrays subscripted by index arrays. Technical Report RICE COMP TR91-162, Dept. of Computer Science, Rice University, December 1990.
13. William Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Supercomputing ‘91, Nov 1991. To appear in Communications of the ACM.
14. Hudson Ribas. Obtaining dependence vectors for nested-loop computations. In Proc of 1990 International Conference on Parallel Processing, August 1990.
15. Carl Rosene. Incremental Dependence Analysis. PhD thesis, Dept. of Computer Science, Rice University, March 1990.
16. Robert E. Shostak. On the sup-inf method for proving presburger formulas. Journal of the ACM, 24(4):529-543, October 1977.
17. Z. Shen, Z. Li, and P. Yew. An emperical student of array subscripts and data dependences. In Proc of 1989 International Conference on Parallel Processing, August 1989.
18. Michael Wolfe. Optimizing Supercompilers for Supercomputers. Pitman Publishing, London, 1989.
19. Michael Wolfe. The tiny loop restructuring research tool. In Proc of 1991 International Conference on Parallel Processing, 1991.
20. Hans Zima and Barbara Chapman. Supercompilers for Parallel and Vector Computers. ACM Press, 1991.