Forma: A framework for safe automatic array reshaping

ACM Transactions on Programming Languages and Systems

Volumn 30, Issue 1, 2007, Pages

  Zhao, Peng ^a,c   Cui, Shimin ^b,d   Gao, Yaoqing ^b,d   Silvera, Raúl ^b,d   Amaral, José Nelson ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b IBM TORONTO LAB   (Canada)

^c IBM Canada Ltd ^*  (United States)

^d IBM CANADA LTD   (Canada)

Author keywords

Arrays; Data structure; Reference analysis

Indexed keywords

ARRAY PROCESSING; DATA MINING; DATA REDUCTION; INFORMATION RETRIEVAL; STORAGE ALLOCATION (COMPUTER);

AUTOMATIC ARRAY RESHAPING; DATA LOCALITY; DATA TYPES; POINTERS;

DATA STRUCTURES;

EID: 37049020422     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1290520.1290522     Document Type: Article

References (43)

1. AL-SUKHNI, H., BRATT, I., AND CONNORS, D. A. 2003. Compiler-directed content-aware prefetching for dynamic data structures. In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques (PACT) (New Orleans, LA). 91-100.
2. ALLEN, J. R. AND KENNEDY, K. 1984. Automatic loop interchange. In Proceedings of the SIGPLAN Symposium on Compiler Construction (Montreal, QC, Canada). ACM, New York, 233-246.
3. ANDERSON, J. M., AMARASINGHE, S. P., AND LAM, M. S. 1995. Data and computation transformations for multiprocessors. In Proceedings of the Symposium of Principles and Practice of Parallel Programming (PPoPP) (Santa Barbara, CA). 166-178.
4. BADAWY, A.-H., AGGARWAL, A., YEUNG, D., AND TSENG, C.-W. 2001. Evaluating the impact of memory system performance on software prefetching and locality optimizations. In Proceedings of the 2001 International Conference on Supercomputing (ICS'01) (Sorrento, Italy). 486-500.
5. CHASE, D. R., WEGMAN, M., AND ZADECK, F. K. 1990. Analysis of pointers and structures. In Proceedings of the Programming Language Design and Implementation (PLDI) (White Plains, NY). ACM, New York, 296-310.
6. CHILIMBI, T. M., DAVIDSON, B., AND LAURUS, J. R. 1999. Cache-conscious structure definition. In Proceedings of the Programming Language Design and Implementation (PLDI) (Atlanta, GA). ACM, New York, 13-24.
7. CONDIT, J., HARREN, M., MCPEAK, S., NECULA, G. C., AND WEIMER, W. 2003. Cured in the real world. In Proceedings of the Programming Language Design and Implementation (PLDI) (San Diego, CA). ACM, New York, 232-244.
8. DING, C. AND KENNEDY, K. 1999. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the Programming Language Design and Implementation (PLDI) (Atlanta, GA). ACM, New York, 229-241.
9. FRANZ, M. AND KISTLER, T. 1998. Splitting data objects to increase cache utilization. Tech. Report ICS-TR-98-34, Dept. of Information and Computer Science, Univ. of California, Irvine, Irvine, CA, Oct.
10. HIND, M. AND PIOLI, A. 2000. Which pointer analysis should I use? In Proceedings of the International Symposium, on Software Testing and Analysis (Portland, OR). 113-123.
11. HOLTE, R. C., MKADMI, T., ZIMMER, R. M., AND MACDONALD, A. J. 1996. Speeding up problem solving by abstraction: A graph oriented approach. Artif. Intell. 85, 1-2, 321-361.
12. HSU, C., AND KREMER, U. 2000. A stable and efficient loop tiling algorithm. In Proceedings of the Mid-Atlantic Student Workshop on Programming Languages and Systems (Newark, DE).
13. IBM. 2001. The Power4® Processor Introduction and Tuning Guide. IBM Corp. International Technical Support Organization, http://www.redbooks.ibm.com/.
14. INTEL. 2002. Intel® Itanium® Architecture Software Developer's Manual. Intel Corporation.
15. ISHIZAKA, K., OBATA, M., AND KASAHARA, H. 2003. Cache optimization for coarse grain task parallel processing using inter-array padding. In Proceedings of the Workshop on Languages and Compilers for Parallel Computing (LCPC) (College Station, TX). 64-76.
16. ISO/IEC. 1990. Programming Languages - C. lst Edition. International Standard ISO/IEC 9899.
17. KARLSSON, M., DAHLGREN, F., AND STENSTROM, R 2000. A prefetching technique for irregular accesses to linked data structures. In Proceedings of the 6th International Symposium on High-Performance Computer Architecture (Toulouse, France). 206-217.
18. KENNEDY, K. 2000. Fast greedy weighted fusion. In Proceedings of the 14th International Conference on Supercomputing. Santa Fe, NM, 131-140.
19. KODUKULA, I., AHMED, N., AND PINGALI, K. 1997. Data-centric multi-level blocking. In Proceedings of the Programming Language Design and Implementation (PLDI) (Las Vegas, NV). ACM, New York, 346-357.
20. LATTNER, C., AND ADVE, V. 2002. Automatic pool allocation for disjoint data structures. In ACM SIGPLAN Workshop on Memory System Performance (Berlin, Germany). ACM, New York, 13-24.
21. LUK, C. K. 2000. Optimizing the cache performance of non-numeric applications. Ph.D. dissertation, Dept. of Computer Science, Univ. of Toronto, Toronto, Ont., Canada.
22. LUK, C.-K. AND MOWRY, T. C. 1996. Compiler-based prefetching for recursive data structures. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (Cambridge, MA). ACM, New York, 222-233.
23. MCKINLEY, K. S., CARR, S., AND TSENG, C.-W. 1996. Improving data locality with loop transformations. ACM Trans. Prog. Lang. Syst. 18, 4 (July), 424-453.
24. NECULA, G. C., MCPEAK, S., AND WEIMER, W. 2002. CCured: Type-safe retrofitting of legacy code. In Proceedings of the Principles of Programming Languages (POPL) (Portland, OR). ACM, New York, 128-139.
25. NIEWIADOMSKI, R., AMARAL, J. N., AND HOLTE, R. 2003. Crafting data structures: A study of reference locality in refinement-based path finding. In Proceedings of the International Conference on High Performance Computing (Hyderabad, India). Springer-Verlag, New York, 438-448.
26. NIEWIADOMSKI, R., AMARAL, J. N., AND HOLTE, R. C. 2004. A performance study of data layout techniques for improving data locality in refinement-based pathfinding. ACM J. Exper. Algor. 9, 1.4, 1-28.
27. PALEM, S., RABBAH, R., MOONEY V. J., KORKMAZ, P., AND PUTTASWAMY, K. 2000. Design space optimization of embedded memory systems via data remapping. In Proceedings of the 2002 Joint Conference on Languages, Compilers, and Tools for Embedded Systems & Software and Compilers for Embedded Systems (LCTES'02-SCOPES'02) (Berlin, Germany). ACM, New York, 28-37.
28. RABBAH, R., AND PALEM, S. 2003. Data remapping for design space optimization of embedded memory systems. ACM Trans. Embed. Comput. Syst. 2, 2, 186-218.
29. RIVERA, G. AND TSENG, C.-W. 1998. Data transformations for eliminating conflict misses. In Proceedings of the Programming Language Design and Implementation (PLDI) (Montreal, Que., Canada). ACM, New York, 38-49.
30. RIVERA, G. AND TSENG, C.-W. 1999. A comparison of compiler tiling algorithms. In Proceedings of the 8th International Conference on Compiler Construction (Amsterdam, Netherlands). Springer-Verlag, New York, 168-182.
31. ROTH, A., MOSHOVOS, A., AND SOHI, G. S. 1998. Dependence based prefetching for linked data structures. ACM SIGPLAN Notices 33, 11, 115-126.
32. RYDER, B. G. 2003. Dimensions of precision in reference analysis of object-oriented programming languages. In Proceedings of the International Conference on Compiler Construction (Warsaw, Poland). Springer-Verlag, New York, 168-179.
33. SINGHAI, S. AND MCKINLEY, K. 1996. Loop fusion for data locality and parallelism. In Proceedings of the Mid-Atlantic Student Workshop on Programming Languages and Systems (New Paltz, NY).
34. SINGHAI, S., AND MCKINLEY, K. S. 1997. A parameterized loop fusion algorithm for improving parallelism and cache locality. Compute. J. 40, 6, 340-355.
35. STEENSGAARD, B. 1996a. Points-to analysis by type inference of programs with structures and unions. In Proceedings of the 6th International Conference on Compiler Construction (Linkoping, Sweden). Springer-Verlag, New York, 136-150.
36. STEENSGAARD, B. 1996b. Points-to analysis in almost linear time. In Proceedings of the Principles of Programming Languages (POPL) (St. Petersburg, FL). ACM, New York, 32-41.
37. STOUTCHININ, A., AMARAL, J. N., GAO, G. R., DEHNERT, J., JAIN, S., AND DOUILLET, A. 2001. Speculative prefetching of induction pointers. In Proceedings of the International Conference on Compiler Construction 2001 (Genova, Italy). Springer-Verlag, New York, 289-303.
38. STROUT, M. M., CARTER, L., AND FERRANTE, J. 2003. Compile-time composition of run-time data and iteration reorderings. In Proceedings of the Symposium Programming Language Design and Implementation (PLDI) (San Diego, CA). ACM, New York, 91-102.
39. VANDERWIEL, S. P. AND LILJA, D. J. 2000. Data prefetch mechanisms. ACM Comput. Sur. 32, 2, 174-199.
40. WOLFE, M. 1987. Iteration space tiling for memory hierarchies. In Proceedings of the 3rd Annual SIAM Conference on Parallel Processing for Scientific Computing (Reno, NV). SIAM, 357-361.
41. WOLFE, M. J. 1996. High Performance Compilers for Parallel Computing. Addison-Wesley, Reading, MA.
42. YONG, S. H., HORWRRZ, S., AND REPS, T. 1999. Pointer analysis for programs with structures and casting. In Proceedings of the Symposium on Programming Language Design and Implementation (PLDI) (Atlanta, GA). ACM, New York, 91-103.
43. ZHONG, Y., ORLOVICH, M., SHEN, X., AND DING, C. 2004. Array regrouping and structure splitting using whole-program reference affinity. In Proceedings of the Symposium on Programming Language Design and Implementation (PLDI) (Washington, DC). ACM, New York, 255-266.