Optimizing aggregate array computations in loops

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 1, 2005, Pages 91-125

  Liu, Yanhong A ^a,c   Stoller, Scott D ^a,c   Li, Ning ^b   Rothamel, Tom ^a,c  

^a STONY BROOK UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c Stony Brook University   (United States)

Author keywords

Array dependence analysis; Caching intermediate results; Incremental computation; Loop optimization; Program transformation

Indexed keywords

ARRAY COMPUTATIONS; CODE GENERATION; LOOP INCREMENTALIZATION; PROGRAM ANALYSIS;

AUTOMATIC PROGRAMMING; COMPUTATIONAL METHODS; GRAPHIC METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; MULTIMEDIA SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 13644284563     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/1053468.1053471     Document Type: Article

References (70)

1. AHMED, N., MATEEV, N., AND PINGALI, K. 2001. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. Int. J. Paral. Prog. 29, 5 (Oct.), 493-544.
2. ALLAN, V. H., JONES, R. B., LEE, R. M., AND ALLAN, S. J. 1995. Software pipelining. ACM Comput. Surv. 27, 3 (Sept.), 366-432.
3. ALLEN, F. E. AND COCKE, J. 1971. A catalogue of optimizing transformations. In Design and Optimization of Compilers. R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, N.J. pp. 1-30.
4. ALLEN, J. R. 1983. Dependence analysis for subscripted variables and its application to program transformations. Ph.D. dissertation, Rice Univ.
5. BANERJEE, U. 1990. Unimodular transformations of double loops. In Proceedings of the Workshop on Advances in Languages and Compilers for Parallel Processing (Aug.), pp. 192-219.
6. BAUER, F. L., MÖLLER, B., PARTSCH, H., AND PEPPER, P. 1989. Formal program construction by transformations - Computer-aided, intuition-guided programming. IEEE Trans. Softw. Eng. 15, 2 (Feb.), 165-180.
7. BIRD, R. S. 1984. The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst. 6, 4 (Oct.), 487-504.
8. BOOTH, R. 1997. Inner Loops. Addison-Wesley Developers Press, Reading, Mass.
9. BROMLEY, M., HELLER, S., MCNERNEY, T., AND STEELE JR, G. L. 1991, Fortran at ten gigaflops: The Connection Machine convolution compiler. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation. ACM, New York, 145-156.
10. BROY, M. 1984. Algebraic methods for program construction: The project CIP. In Program Transformation and Programming Environments, P. Pepper, Ed., Springer-Verlag, Berlin, Germany, pp. 199-222.
11. BURSTALL, R. M., AND DARLINGTON, J. 1977. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan.), 44-67.
12. CAI, J., AND PAIGE, R. 1988/89. Program derivation by fixed point computation. Sci. Comput. Program. 11 (Sept.), 197-261.
13. CARR, S., AND KENNEDY, K 1994. Scalar replacement in the presence of conditional control flow. Softw. Pract. Exp. 24, 1, 51-77.
14. CHATTERJEE, S., PARKER, E., HANLON, P. J., AND LEBECK, A. R. 2001. Exact analysis of the cache behavior of nested loops. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation. ACM, New York, pp. 286-297.
15. CHIN, W.-N. 1992. Safe fusion of functional expressions. In Proceedings of the 1992 ACM Conference on LISP and Functional Programming. ACM, New York, pp. 11-20.
16. COCKE, J., AND KENNEDY, K 1977. An algorithm for reduction of operator strength. Commun. ACM 20, 11 (Nov.), 850-856.
17. CONSEL, C., AND NOËL, F. 1996. A general approach for run-time specialization and its application to C. In Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
18. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs, N.J.
19. EARLEY, J. 1976. High level iterators and a method for automatically designing data structure representation. J. Comput. Lang. 1, 321-342.
20. ERNST, M. D. 1992. Serializing parallel programs by removing redundant computation. Master's thesis. MIT, Cambridge, Mass. (Revised August 1994.)
21. FABER, P., GRIEBL, M., AND LENGAUER, C. 2001. Loop-carried code placement. In Proceedings of the 7th International Euro-Par Conference. Lecture Notes in Computer Science, vol. 2150. Springer-Verlag, New York.
22. FEAUTRIER, P. 1988. Parametric integer programming. Operationnelle / Oper. Res. 22, 3 (Sept.), 243-268.
23. FEAUTRIER, P. 1991. Dataflow analysis of array and scalar references. Int. J. Parall. Prog. 20, 1 (Feb.).
24. FISHER, A. L. AND HIGHNAM, P. T. 1988. Communication and code optimization in SIMD programs. In International Conference on Parallel Processing (Aug.).
25. FISHER, A. L., LEON, J., AND HIGHNAM, P. T. 1990. Design and performance of an optimizing SIMD compiler. In Frontiers of Massively Parallel Computation.
26. FONG, A. C. 1979. Inductively computable constructs in very high level languages. In Conference Record of the 6th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 21-28.
27. FONG, A. C. AND ULLMAN, J. D. 1976. Inductive variables in very high level languages. In Conference Record of the 3rd Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 104-112.
28. FRANKSEN, O. I. 1985. Mr. Babbage's Secret : The Tale of a Cypher and APL. Prentice-Hall, Englewood Cliffs, N.J.
29. GARG, V. K. AND MITCHELL, J. R. 1996. An efficient algorithm for detecting conjunctions of general global predicates. Tech. Rep. TR-PDS-1996-005. University of Texas at Austin, Austin, Tex.
30. GOLDBERG, A. AND PAIGE, R. 1984. Stream processing. In Conference Record of the 1984 ACM Symposium on LISP and Functional Programming. ACM, New York, pp. 53-62.
31. GOLDSTINE, H. H. 1972. Charles Babbage and his analytical engine. In The Computer from Pascal to von Neumann, Princeton University Press, Princeton, N.J., Chap. 2, 10-26.
32. GOUBAULT, E. 2001. Static analyses of the precision of floating-point operations. In Proceedings of the 8th International Static Analysis Symposium, Lecture Notes in Computer Science, vol. 2126. Springer-Verlag, Berlin, Germany.
33. GRAU, A. A., HILL, U., AND LANGMAAC, H. 1967. Translation of ALGOL 60. Volume 1 of Handbook for Automatic Computation. Springer, Berlin, Germany.
34. GRIES, D. 1984. A note on a standard strategy for developing loop invariants and loops. Sci. Comput. Program., 2, 207-214.
35. GUIBAS, L. AND WYATT, K. 1978. Compilation and delayed evaluation in APL. In Conference Record of the 5th Annual ACM Symposium on Principles of Programming Languages. ACM, New York. pp. 1-8.
36. HIGHAM, N. J. 1996. Accuracy and Stability of Numerical Algorithms. SLAM, Philadelphia, Pa.
37. HIGHNAM, P. T. 1991. Systems and Programming Issues in the Design and Use of a SIMD Linear Array for Image Processing. Ph.D. dissertation. Department of Computer Science, Carnegie Mellon University, Pittsburgh, Pa.
38. KATZ, S. 1978. Program optimization using invariants. IEEE Trans. Softw. Eng. SE-4, 5 (Nov.), 378-389.
39. KELLY, W. AND PUGH, W. 1994. Finding legal reordering transformations using mappings. In Proceedings of the 7th Annual Workshop on Programming Languages and Compilers for Parallel Computing. (Ithaca, N.Y, Aug.) Lecture Notes in Computer Science, vol. 829. Springer-Verlag, New York.
40. KNUTH, D. E. 1971. An empirical study of FORTRAN programs. Softw. Pract. Exp. 1, 2, 105-133.
41. Li, K. 1997. Interferometric strain/slope rosette for static and dynamic measurements. Exper. Mech. 37, 2, 111-118.
42. Liu, Y. A. 1997. Principled strength reduction. In Algorithmic Languages and Calculi, R. Bird and L. Meertens, Ed. Chapman & Hall, London, U.K. 357-381.
43. Liu, Y. A. 2000. Efficiency by incrementalization: An introduction. High. Ord. Symb. Comput. 13, 4 (Dec.), 289-313.
44. Liu, Y A. AND STOLLER, S. D. 2002. Program optimization using indexed and recursive data structures. In Proceedings of the ACM SIGPLAN 2002 Workshop on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York, 108-118.
45. Liu, Y A. AND STOLLER, S. D. 2003. Dynamic programming via static incrementalization. High. Order Symb. Comput. 16 1-2 (Mar.-June), 37-62. (An earlier version appeared in Proceedings of the 8th European Symposium on Programming, 1999.)
46. Liu, Y A. AND STOLLER, S. D. 2003. Dynamic programming via static incrementalization. High. Order Symb. Comput. 16 1-2 (Mar.-June), 37-62. (An earlier version appeared in Proceedings of the 8th European Symposium on Programming, 1999.)
47. Liu, Y A., STOLLER, S. D., AND TEITELBAUM, T. 1998. Static caching for incremental computation. ACM Trans. Program. Lang. Syst. 20, 3 (May), 546-585. (An earlier version appeared in Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995.)
48. Liu, Y A., STOLLER, S. D., AND TEITELBAUM, T. 1998. Static caching for incremental computation. ACM Trans. Program. Lang. Syst. 20, 3 (May), 546-585. (An earlier version appeared in Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995.)
49. Liu, Y A., STOLLER, S. D., AND TEITELBAUM, T. 2001. Strengthening invariants for efficient computation. Sci. Comput. Program. 41, 2 (Oct.), 139-172. (An earlier version appeared in Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996.)
50. Liu, Y A., STOLLER, S. D., AND TEITELBAUM, T. 2001. Strengthening invariants for efficient computation. Sci. Comput. Program. 41, 2 (Oct.), 139-172. (An earlier version appeared in Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996.)
51. Liu, Y. A. AND TEITELBAUM, T. 1995. Systematic derivation of incremental programs. Sci. Comput. Program. 24, 1 (Feb.), 1-39.
52. MASLOV, V. 1994. Lazy array data-flow dependence analysis. In Conference Record of the 21st Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
53. PAIGE, R. 1990. Symbolic finite differencing-Part I. In Proceedings of the 3rd European Symposium on Programming, N. D. Jones, Ed. Lecture Notes in Computer Science, vol. 432. Springer-Verlag, Berlin, Germany, pp. 36-56.
54. PAIGE, R. AND KOENIG, S. 1982. Finite differencing of computable expressions. ACM Trans. Program. Lang. Syst. 4, 3 (July), 402-154.
55. Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation. ACM, New York, 1996.
56. PUGH, W. 1991. Uniform techniques for loop optimization. In International Conference on Supercomputing (Cologne, Germany, June), pp. 341-352.
57. PUGH, W. 1992. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Commun. ACM 31, 8 (Aug.), 102-114.
58. PUGH, W. AND WONNACOTT, D. 1998. Constraint-based array dependence analysis. ACM Trans. Program. Lang. Syst. 20, 3, 635-678.
59. REPS, T. AND TEITELBAUM, T. 1988. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York.
60. SARKAE, V. AND THEKKATH, R. 1992. A general framework for iteration-reordering loop transformations. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design, and Implementation. ACM, New York, pp. 175-187.
61. SMITH, D. R. 1990. KIDS: A semiautomatic program development system. IEEE Trans. Softw. Eng. 16, 9 (Sept.), 1024-1043.
62. WADLER, P. 1988. Deforestation: Transforming programs to eliminate trees. In Proceedings of the 2nd European Symposium on Programming. Lecture Notes in Computer Science, vol. 300. Springer-Verlag, Berlin, Germany, pp. 344-358.
63. WARREN, J. 1984. A hierarchical basis for reordering transformations. In Conference Record of the llth Annual ACM Symposium on Principles of Programming Languages. ACM, New York. 272-282.
64. WATERS, R. C. 1991. Automatic transformation of series expressions into loops. ACM Trans. Program. Lang. Syst. 13, 1 (Jan.), 52-98.
65. WEBB, J. A. 1992. Steps towards architecture-independent image processing. IEEE Comput. 25, 2 (Feb.), 21-31.
66. WEGBREIT, B. 1976. Goal-directed program transformation. IEEE Trans. Softw. Eng. SE-2, 2 (June), 69-80.
67. WELLS III, W. M. 1986. Efficient synthesis of Gaussian filters by cascaded uniform filters. IEEE Trans. Patt. Anal. Mach. Intell. 8, 2 (Mar.), 234-239.
68. YELLIN, D. M. AND STROM, R. E. 1991. INC: A language for incremental computations. ACM Trans. Program. Lang. Syst. 13, 2 (Apr.), 211-236.
69. ZABIH, R. 1994. Individuating unknown objects by combining motion and stereo. Ph.D. dissertation. Department of Computer Science, Stanford University, Stanford, Calif.
70. ZABIH, R. AND WOODFILL, J. 1994. Non-parametric local transforms for computing visual correspondence. In Proceedings of the 3rd European Conference on Computer Vision, J.-O. Eklundh, Ed. Lecture Notes in Computer Science, vol. 801. Springer-Verlag, New York, pp. 151-158.