Polynomial time array dataflow analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2624, Issue , 2003, Pages 411-426

  Seater, Robert ^a   Wonnacott, David ^a  

^a HAVERFORD COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROGRAM COMPILERS; SUPERCOMPUTERS;

ANALYSIS TECHNIQUES; ASYMPTOTIC TIME COMPLEXITY; DATA DEPENDENCE ANALYSIS; DATA-FLOW INFORMATION; POLYNOMIAL-TIME ALGORITHMS; PRESBURGER ARITHMETIC; UNINTERPRETED FUNCTION SYMBOLS; WORST-CASE COMPLEXITY;

DATA FLOW ANALYSIS;

EID: 35248893874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-35767-x_27     Document Type: Article

References (35)

1. R. Eigenmann, J. Hoeflinger, Z. Li, and D. Padua. Experience in the automatic parallelization of 4 Perfect benchmark programs. In Proceedings of the 4th Workshop on Programming Languages and Compilers for Parallel Computing, August 1991. Also Technical Report 1193, CSRD, Univ. of Illinois.
2. Paul Feautrier. Toward automatic distribution. Parallel Processing Letters, 4(3):233-244, September 1994.
3. David Wonnacott. Using Time Skewing to eliminate idle time due to memory bandwidth and network limitations. In Proceedings of the 2000 International Parallel and Distributed Processing Symposium, May 2000. An earlier version is available as Rutgers University DCS TR 388.
4. William Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 35(8):102-114, August 1992.
5. William Pugh and David Wonnacott. An exact method for analysis of value-based array data dependences. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, August 1993. Also available as Tech. Report CS-TR-3196, Dept. of Computer Science, University of Maryland, College Park.
6. William Pugh and David Wonnacott. Constraint-based array dependence analysis. ACM Trans. on Programming Languages and Systems, 20(3):635-678, May 1998.
7. D. E. Maydan, J. L. Hennessy, and M. S. Lam. Efficient and exact data dependence analysis. In ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 1-14, June 1991.
8. G. Kreisel and J. L. Krevine. Elements of Mathematical Logic. North-Holland Pub. Co., 1967.
9. Michael J. Fischer and Michael O. Rabin. Super-exponential complexity of Presburger arithmetic. In Richard M. Karp, editor, Proceedings of the SIAM-AMS Symposium in Applied Mathematics, volume 7, pages 27-41, Providence, RI, 1974. AMS.
10. 22pn upper bound on the complexity of presburger arithmetic. Journal of Computer and System Sciences, 16(3):323-332, July 1978.
11. Dror Eliezer Maydan. Accurate Analysis of Array References. PhD thesis, Computer Systems Laboratory, Stanford U., September 1992.
12. Robert Seater and David Wonnacott. Polynomial time array dataflow analysis. Technical Report 2000-38, Center for Discrete Mathematics and Theoretical Computer Science, November 2000.
13. M. Berry et al. The PERFECT Club benchmarks: Effective performance evaluation of supercomputers. International Journal of Supercomputing Applications, 3(3):5-40, March 1989.
14. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
15. William Pugh and David Wonnacott. Eliminating false data dependences using the Omega test. In SIGPLAN Conference on Programming Language Design and Implementation, pages 140-151, San Francisco, California, June 1992.
16. David G. Wonnacott. Constraint-Based Array Dependence Analysis. PhD thesis, Dept. of Computer Science, The University of Maryland, August 1995. Available as ftp://ftp.cs.umd.edu/pub/omega/davewThesis/davewThesis.ps.
17. Robert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351-360, April 1979.
18. William Pugh and David Wonnacott. Nonlinear array dependence analysis. In Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Troy, New York, May 1995.
19. P. Downey. Undecidability of presburger arithmetic with a single monadic predicate letter. Technical Report 18-72, Center for Research in Computing Technology, Havard Univ., 1972.
20. Louis Comtet. Advanced Combinatorics. D. Reidel Publishing Company, Dordrecht, Holland, 1974.
21. M. J. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, Cambridge, Mass., 1989.
22. Thomas Brandes. The importance of direct dependences for automatic parallelism. In Proceedings of the 2nd International Conference on Supercomputing, pages 407-417, July 1988.
23. Hudson Ribas. Obtaining dependence vectors for nested-loop computations. In Proceedings of 1990 International Conference on Parallel Processing, pages 11-212 - II-219, August 1990.
24. Carl Rosene. Incremental Dependence Analysis. PhD thesis, Dept. of Computer Science, Rice University, March 1990.
25. 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.
26. Paul Feautrier. Dataflow analysis of scalar and array references. International Journal of Parallel Programming, 20(1):23-53, February 1991.
27. M. W. Hall, B. R. Murphy, S. P. Amarasinghe, S. Liao, and M. S. Lam. Interprocedural analysis for parallelization. In Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing, August 1995.
28. Saman P. Amarasinghe. Parallelizing Compiler Techniques Based on Linear Inequalities. PhD thesis, Computer Systems Laboratory, Stanford U., January 1997.
29. Sungdo Moon, Mary W. Hall, and Brian R. Murphy. Predicated array data-flow analysis for run-time parallelization. In Proceedings of the 1998 International Conference on Super-computing, July 1998.
30. Sungdo Moon and Mary W. Hall. Evaluation of predicated array data-flow analysis for automatic parallelization. In Proceedings of the 7th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 84-95, May 1999.
31. Zhiyuan Li. Array privatization for parallel execution of loops. In Proceedings of the 1992 International Conference on Supercomputing, pages 313-322, July 1992.
32. Junjie Gu, Zhiyuan Li, and Gyungho Lee. Symbolic array dataflow analysis for array privatization and program parallelization. In Supercomputing '95, San Diego, Ca, December 1995.
33. Junjie Gu, Zhiyuan Li, and Gyungho Lee. Experience with efficient array data flow analysis for array privatization. In Proceedings of the 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 157-167, Las Vegas, Nevada, June 1997.
34. Peng Tu and David Padua. Array privatization for shared and distributed memory machines. In Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Multiprocessors, September 1992.
35. Peng Tu. Automatic Array Privatization and Demand-Driven Symbolic Analysis. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1995.