On the parallel execution time of tiled loops

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 3, 2003, Pages 307-321

  Högstedt, Karin ^a   Carter, Larry ^b   Ferrante, Jeanne ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF SAN DIEGO   (United States)

Author keywords

Blocking; Compiler optimization; Parallel compilers; Tiling

Indexed keywords

COMPUTER SIMULATION; DIFFERENTIAL EQUATIONS; DYNAMIC PROGRAMMING; INTERPOLATION; LINEAR PROGRAMMING; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS);

COMPILER OPTIMIZATION; EXECUTION TIME; PARALLEL COMPILERS; TILED LOOPS; TILING;

PARALLEL PROCESSING SYSTEMS;

EID: 0037962984     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1189587     Document Type: Article

References (47)

1. G. Almasi, B. Alpern, L. Berman, L. Carter, and D. Hale, "A Case-Study in Performance Programming: Seismic Migration," Proc. Symp. High Performance Computing, Sept. 1991.
2. C. Ancourt and F. Irigoin, "Automatic Code Distribution," Proc. Third Workshop Compilers for Parallel Computers (CPC '92), July 1992.
3. R. Andonov, S. Rajopadhye, and N. Yanev, "Optimal Orthogonal Tiling," Proc. Europar '98, pp. 480-490, Sept. 1998.
4. U. Banerjee, "Unimodular Transformations of Double Loops," Proc. Workshop Programming Languages and Compilers for Parallel Computing, Aug. 1990.
5. N.H.F. Beebe, "Matrix Multiply Benchmarks," technical report, Center for Scientific Computing, Dept. of Math., Univ. of Utah, 1990, This report is updated frequently.
6. J. Bilmes, K. Asanovic, C.-W. Chin, and J. Demmel, "Optimizing Matrix Multiply Using PhiPAC: A Portable, High Performance, ANSI C Coding Methodology," Proc. 11th Int'l Conf. Supercomputing (ICS '97), pp. 340-347, July 1997.
7. P. Boulet, A. Darte, T. Risset, and Y. Robert, "(Pen)-Ultimate Tiling?" INTEGRATION, the Very Large Scale Intergration J., vol. 17, pp. 33-51, 1994.
8. D. Callahan, J. Cocke, and K. Kennedy, "Estimating Interlock and Improving Balance for Pipelined Machines," J. Parallel and Distributed Computing, vol. 5, no. 4, pp. 334-358, Aug. 1988.
9. S. Carr, "Combining Optimization for Cache and Instruction-Level Parallelism," Proc. Int'l Conf. Parallel Architectures and Compilation Techniques (PACT '96), pp. 238-247, 1996.
10. S. Carr and K. Kennedy, "Compiler Blockability of Numerical Algorithms," J. Supercomputing, pp. 114-124, Nov. 1992.
11. S. Carr, K.S. McKinley, and C.-W. Tseng, "Compiler Optimizations for Improving Data Locality," Proc. Sixth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, Oct. 1994.
12. L. Carter, J. Ferrante, and S.F. Hummel, "Efficient Parallelism via Hierarchical Tiling," Proc. SIAM Conf. Parallel Processing for Scientific Computing, Feb. 1995.
13. L. Carter, J. Ferrante, and S.F. Hummel, "Hierarchical Tiling for Improved Superscalar Performance," Proc. Int'l Parallel Processing Symp., Apr. 1995.
14. S. Coleman and K.S. McKinley, "Tile Size Selection Using Cache Organization and Data Layout," Programming Language Design and Implementation, June 1995.
15. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, sixth ed., MIT Press and McGraw-Hill, 1992.
16. D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K.E. Schauser, R. Subramonian, and T. von Eicken, "LogP: A Practical Model of Parallel Computation," Comm. ACM, vol. 39, no. 11, pp. 78-85, Nov. 1996.
17. A. Darte, L. Khachiyan, and Y. Robert, "Linear Scheduling is Nearly Optimal," Parallel Processing Letters, vol. 1, no. 2, pp. 73-81, 1991.
18. F. Desprez, J. Dongarra, F. Rastello, and Y. Robert, "Determining the Idle Time of a Tiling: New Results," Proc. Int'l Conf. Parallel Architectures and Compilation Techniques (PACT '97), Nov. 1997.
19. S.V. Rajopadhye, F. Quiller, and D. Wilde, "Generation of Efficient Nested Loops from Polyhedra," Int'l J. Parallel Programming, vol. 28, no. 5, pp. 469-498, 2000.
20. J. Ferrante, K.J. Ottenstein, and J.D. Warren, "The Program Dependence Graph and Its Use in Optimization," ACM Trans. Programming Languages and Systems, vol. 9, no. 3, pp. 319-349, July 1987.
21. K. Högstedt, "Predicting Performance for Tiled Perfectly Nested Loops," PhD thesis, Univ. of California, San Diego, Dept. of Computer Science and Eng., Dec. 1999.
22. K. Högstedt, L. Carter, and J. Ferrante, "Determining the Idle Time of a Tiling," Proc. Symp. Principles of Programming Languages, Jan. 1997.
23. K. Högstedt, L. Carter, and J. Ferrante, "Selecting Tile Shape for Minimal Execution Time," Proc 11th ACM Symp. Parallel Algorithms and Architectures, June 1999.
24. F. Irigoin and R. Triolet, "Supernode Partitioning," Proc. Symp. Principles of Programming Languages, pp. 319-328, Jan. 1988.
25. K. Kennedy and K.S. McKinley, "Optimizing for Parallelism and Data Locality," Proc. Int'l Conf. Supercomputing, July 1992.
26. K. Kennedy and K.S. McKinley, "Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution," Languages and Compilers for Parallel Computing, 1993.
27. I. Kodukula, N. Ahmed, and K. Pingali, "Data-Centric Multilevel Blocking," Proc. SIGPLAN, Conf. Programming Language Design and Implementation, pp. 346-357, 1997.
28. N. Mitchell, K. Högstedt, L. Carter, and J. Ferrante, "Quantifying the Multilevel Nature of Tiling Interactions," Int'l J. Parallel Programming, vol.26, no. 6, pp. 641-670, 1998.
29. N. Mitchell, L. Carter, J. Ferrante, and K. Högstedt, "Quantifying the Multilevel Nature of Tiling Interactions," Proc. Workshop Languages and Compilers for Parallel Computing, 1997.
30. C.J. Newburn and J.P. Shen, "Automatic Partitioning of Signal Processing Programs for Symmetric Multiprocessors," Proc. 1996 Conf. Parallel Architectures and Compilation Techniques (PACT '96), pp. 269-280, Oct. 1996.
31. F. Quiller and S. V. Rajopadhye, "Optimizing Memory Usage in the Polyhedral Model," ACM Trans. Programming Languages and Systems (TOPLAS), vol. 22, no. 5, pp. 773-815, 2000.
32. J. Ramanujam and P. Sadayappan, "Tiling Multidimensional Iteration Spaces for Nonshared Memory Machines," Supercomputing, Nov. 1991.
33. D.A. Reed, L.M. Adams, and M.L. Patrick, "Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor Systems," IEEE Trans. Computers, vol. 36, no. 7, pp. 845-858, July 1987.
34. V. Sarkar, "Automatic Selection of High-Order Transformations in the IBM XL FORTRAN Compilers," IBM J. Research and Development, vol. 41, no. 3, pp. 233-264, 1997.
35. Y. Song and Z. Li, "New Tiling Techniques to Improve Cache Temporal Locality," Proc. SIGPLAN, Conf. Programming Language Design and Implementation, pp. 215-228, 1999.
36. Standord SUIF Compiler System, http://suif.stanford.edu/, 2002.
37. Sweep3D Benchmark, www.llnl.gov/asci.benchmarks/asci/limtited/sweep3d/asci_sweep3d.html, 1995.
38. R.C. Whaley and J.J. Dongarra, "Automatically Tuned Linear Algebra Software," Supercomputer, 1998.
39. M.E. Wolf, "Improving Locality and Parallelism in Nested Loops," Phd thesis, Stanford Univ., Computer Systems Laboratory, Aug. 1992.
40. M.E. Wolf and M.S. Lam, "A Data Locality Optimizing Algorithm," Proc. Symp. Programming Language Design and Implementation, Apr. 1991.
41. M.E. Wolf and M.S. Lam, "A Loop Transformation Theory and an Algorithm to Maximize Parallelism," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 452-471, 1991.
42. M.E. Wolf, D. Maydan, and D.-K. Chen, "Combining Loop Transformations Considering Caches and Scheduling," Proc. Ninth Int'l Symp. Microarchitecture, Dec. 1996.
43. I.M.J. Wolfe, "Iteration Space Tiling for Memory Hierarchies," Parallel Processing for Scientific Computing, pp. 357-361, 1987.
44. M.J. Wolfe, "More Iteration Space Tiling," Supercomputing, pp. 655-664, 1989.
45. M.J. Wolfe, High Performance Compilers for Parallel Computing. Addison-Wesley, 1996.
46. D. Wonnacott, "Time Skewing for Parallel Computers," Languages and Compilers for Parallel Computing, Springer-Verlag, Aug. 1999.
47. J. Xue and C.-H. Huang, "Reuse-Driven Tiling for Improving Data Locality," Int'l J. Parallel Programming, vol. 26, no. 6, pp. 671-696, 1998.