Automatic tiling of iterative stencil loops

ACM Transactions on Programming Languages and Systems

Volumn 26, Issue 6, 2004, Pages 975-1028

  Li, Zhiyuan ^a,b   Song, Yonghong ^a,b  

^a PURDUE UNIVERSITY   (United States)

^b Purdue University   (United States)

Author keywords

Caches; Loop transformations; Optimizing compilers

Indexed keywords

CACHES; ITERATIVE STENCIL LOOPS; LOOP TRANSFORMATIONS; OPTIMIZING COMPILERS;

BUFFER STORAGE; COMPUTER SIMULATION; ITERATIVE METHODS; POLYNOMIALS;

COMPUTER PROGRAMMING;

EID: 24644456455     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/1034774.1034777     Document Type: Article

References (57)

1. ADMAS, J. C. 1999. MUDPACK: Multigrid Software for Elliptic Partial Differential Equations. Available on line at http://www.scd.ucar.edu/css/ software/mudpack/.
2. AHMED, N., MATEEV, N., AND PINGALI, K. 2000. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. In Proceedings of the 2000 International Conference on Supercomputing (Santa FE, NM). 141-152.
3. AHUJA, R., MAGNANTI, T., AND ORLIN, J. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Englewood Cliffs, NJ.
4. ALLAN, V., JONES, R., LEE, R., AND ALLAN, S. 1995. Software pipelining. ACM Comput. Surv. 27, 3 (Sept.), 367-432.
5. ALLEN, J. R. AND KENNEDY, K. 1984. Automatic translation of FORTRAN programs to vector form. ACM Trans. Programm. Lang. Syst. 9, 4 (Oct.), 491-542.
6. ANDERSEN, B. S., GUSTAVSON, F. G., WASNIEWSKI, J., AND YALAMOV, P. Y. 1999. Recursive formulation of some dense linear algebra algorithms. In Proceedings of the SIAM Conference on Parallel Processing for Scientific Computing (San Antonio, TX).
7. ANDERSON, J. M., AMARASINGHE, S. P., AND LAM, M. S. 1995. Data and computation transformation for multiprocessors. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Santa Barbara, CA). 166-178.
8. BACON, D., CHOW, J.-H., JU, D., MUTHUKUMAR, K., AND SARKAR, V. 1994. A compiler framework for restructuring data declarations to enhance cache and tlb effectiveness. In Proceedings of CASCON'94 (Toronto, Ont., Canada).
9. BLUME, W. AND EIGENMANN, R. 1998. Non-linear and symbolic data dependence testing. IEEE Trans. Parall. Distrib. Syst. 9, 12 (Dec.), 1180-1194.
10. BOULET, P., DONGARRA, J., ROBERT, Y., AND VIVIEN, F. 1999. Static tiling for heterogeneous computing platforms. Parall. Comput. 25, 547-568.
11. BRIGGS, P., COOPER, K., KENNEDY, K., AND TORCSON, L. 1989. Coloring heuristics for register al-location. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. 275-384.
12. BURGER, D. C., GOODMAN, J. R., AND KÄGI, A. 1996. Memory bandwidth limitations of future microprocessors. In Proceedings of the 23rd International Symposium on Computer Architecture (Philadelphia, PA). 78-89.
13. CHAME, J. AND MOON, S. 1999. A tile selection algorithm for data locality and cache interference. In Proceedings of the Thirteenth ACM International Conference on Supercomputing (Rhodes, Greece). 492-499.
14. CHATTERJEE, S., JAIN, V., LEBECK, A., MUNDHRA, S., AND THOTTETHODI, M. 1999a. Nonlinear array layouts for hierarchical memory systems. In Proceedings of the Thirteenth ACM International Conference on Supercomputing (Rhodes, Greece). 444-453.
15. CHATTERJEE, S., LEBECK, A., PATNALA, P. K., AND THOTTETHODI, M. 1999b. Recursive array layouts and fast parallel matrix multiplication. In Proceedings of the 11th ACM Symposium on Parallel Algorithms and Architectures (Saint Malo, France).
16. COCIORVA, D., WILKINS, J. W., LAM, C., BAUMGARTNER, G., RAMANUJAM, J., AND SADAYAPPAN, P. 2001. Loop optimization for a class of memory-constrained computations. In Proceedings of the 15th ACM International Conference on Supercomputing (Naples, Italy).
17. COLEMAN, S. AND MCKINLEY, K. S. 1995. Tile size selection using cache organization and data layout. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (La Jolla, CA). 279-290.
18. COLLARD, J.-F. 1994. Space-time transformation of while-loops using speculative execution. In Proceedings of the Scalable High Performance Computing Conference (Knoxville, TN). 429-436.
19. CORMEN, T., LEISERSON, C., AND RIVEST, R. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA, and McGraw-Hill Book Company, New York, NY.
20. DING, C. AND KENNEDY, K. 2001. Reducing effective bandwidth through compiler enhancement of global cache reuse. In Proceedings of the International Parallel and Distributed Processing Symposium.
21. FERRANTE, J., SARKAR, V., AND THRASH, W. 1991. On estimating and enhancing cache effectiveness. In Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing. Lecture Notes in Computer Science, vol. 1863. Springer-Verlag, Berlin, Germany, 328-341. August 1991.
22. GARY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY.
23. GHOSH, S., MARTONOSI, M., AND MALIK, S. 1998. Precise miss analysis for program transformations with caches of arbitrary associativity. In Proceedings of the Eighth ACM Conference on Architectural Support for Programming Languages and Operating Systems (San Jose, CA). 228-239.
24. GU, J., LI, Z., AND LEE, G. 1997. Experience with efficient array data flow analysis for array privatization. In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Las Vegas, NV). 157-167.
25. HAGHIGHAT, M. R. 1990. Symbolic dependence analysis for high performance parallelizing compilers. Ph.D. dissertation. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL.
26. HENNESSY, J. AND PATTERSON, D. 1996. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Francisco, CA.
27. JIN, G., MELLOR-CRUMMEY, J., AND FOWLER, R. 2001. Increasing temporal locality with skewing and recursive blocking. In Proceedings of IEEE/ACM SC 2001 (Denver, CO).
28. KANDEMIR, M., CHOUDHARY, A., RAMANUJAM, J., AND BANERJEE, P. 1998. A matrix-based approach to the global locality optimization problem. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT'98, Paris, France).
29. KENNEDY, K. 2000. Fast greedy weighted fusion. In Proceedings of the 2000 International Conference on Supercomputing (Santa Fe, NM).
30. KENNEDY, K. AND MVKINLEY, K. S. 1993. Maximizing loop parallelism and improving data locality via loop fusion and distribution. In Proceedings of the Sixth Workhsop on Languages and Compilers for Parallel Computing (Portland, OR, Aug. 1993). Lecture Notes in Computer Science, vol. 768, Springer-Verlag, Berlin, Germany.
31. KODUKULA, I., AHMED, N., AND PINGALI, K. 1997. Data-centric multi-level blocking. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Las Vegas, NV). 346-357.
32. KODUKULA, I. AND PINGALI, K. 1996. Transformations of imperfectly nested loops. In Proceedings of Supercomputing.
33. LAM, M. S., ROTHBERG, E. E., AND WOLF, M. E. 1991. The cache performance and optimizations of blocked algorithms. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (Santa Clara, CA). 63-74.
34. MANJIKIAN, N. AND ABDELRAHMAN, T. 1997. Fusion of loops for parallelism and locality. IEEE Trans. Parall. and Distribut. Syst. 8, 2 (Feb.), 193-209.
35. MATULA, D. AND BECK, L. 1981. Smallest-last ordering and clustering and graph coloring algorithms. Tech. rep. TR CSE 8104. Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX.
36. MITCHELL, N., HÖGSTEDT, K., CARTER, L., AND FERRANTE, J. 1998. Quantifying the multi-level nature of tiling interactions. Int. J. Parall. Programm. 26, 6 (Dec.), 641-670.
37. NGUYEN, T. AND LI, Z. 1998. Interprocedural analysis for loop scheduling and data allocation. Parall. Comput. 24, 3, 477-504.
38. OBJECT-ORIENTED SCIENTIFIC COMPUTING. 2001. Blitz++. Object-Oriented Scientific Computing, Available online at http://www.oonumerics.org/blitz. benchmarks/.
39. O'BOYLE, M. AND KNIJNENBURG, P. 1997. Non-singular data transformations: Definition, validity and applications. In Proceedings of the ACM International Conference on Supercomputing (Vienna, Austria). 309-316.
40. PANDA, P., NAKAMURA, H., DUTT, N., AND NICOLAU, A. 1999. Augmenting loop tiling with data alignment for improved cache performance. IEEE Trans. Comput. 48, 2 (Feb.), 142-149.
41. PARK, N., HONG, B., AND PRASANNA, V. K. 2002. Analysis of memory hierarchy performance of block data layout. In Proceedings of the International Conference on Parallel Processing (Vancouver, B.C., Canada). 34-44.
42. PUGH, W. 1992. A practical algorithm for exact array dependence analysis. Commun. ACM 35, 8 (Aug.), 102-114.
43. PUGH, W. AND ROSSER, E. 1999. Iteration space slicing for locality. In Proceedings of the Twelfth International Workshop on Languages and Compilers for Parallel Computing (San Diego, CA).
44. PUGH, W., ROSSER, E., AND SHPEISMAN, T. 1996. Exploiting monotone convergence functions in parallel programs. Tech. rep. CS-TR-3636. University of Maryland, College Park, MD.
45. RIVERA, G. AND TSENG, C.-W. 1999. A comparison of compiler tiling algorithms. In Proceedings of the Eighth International Conference on Compiler Construction (Amsterdam, The Netherlands).
46. RIVERA, G. AND TSENG, C.-W. 2000. Tiling optimizations for 3D scientific computations. In Proceedings of the IEEE/ACM SC 2000.
47. ROSSER, E. 1998. Fine-grained analysis of array computations. Ph.D. dissertation. Department of Computer Science, University of Maryland at College Park, MD.
48. SAHKAR, V. 1998. Loop transformations for hierarchical parallelism and locality. In Proceedings of the Fourth Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (Pittsburgh, PA).
49. SONG, Y. AND LI, Z. 1999. New tiling techniques to improve cache temporal locality. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Atlanta, GA). 215-228.
50. SONG, Y., XU, R., WANG, C., AND LI, Z. 2001. Data locality enhancement by memory reduction. In Proceedings of the 15th ACM International Conference on Supercomputing (Naples, Italy).
51. STROUT, M., CARTER, L., FERRANTE, J., AND SIMON, B. 1998. Schedule-independent storage mapping for loops. In Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems (San Jose, CA). 24-33.
52. TEMAM, O., FRICKER, C., AND JALBY, W. 1994. Cache interference phenomena. In Proceedings of the ACM BIOMETRICS Conference on Measurement and Modeling of Computer Systems (Nashville, TN). 261-271.
53. WISE, D. S., ALEXANDER, G. A., FRENS, J. D., AND GU, Y. 2001. Language support for Morton-order matrices. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Snowbird, UT).
54. WOLF, M. 1992. Improving locality and parallelism in nested loops. Ph.D. dissertation. Department of Computer Science, Stanford University, Stanford, CA.
55. WOLFE, M. 1995. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, Reading, MA.
56. WONNACOTT, D. 2002. Achieving scalable locality with time skewing. Int. J. Parall. Programm. 30, 3 (June), 181-221.
57. XUE, J. 2000. Loop Tiling for Parallelism. Kluwer Academic Publishers, Dordrecht, The Netherlands.