Static reuse distances for locality-based optimizations in MATLAB

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2010, Pages 295-304

  Chauhan, Arun ^a   Shei, Chun Yu ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

compilers; locality; MATLAB; memory hierarchy

Indexed keywords

COMPILER OPTIMIZATIONS; DEPENDENCE GRAPHS; EFFICIENT ALGORITHM; END-USERS; EXTENDED VERSIONS; HIGH-LEVEL PROGRAMMING; LARGE OBJECTS; LOCALITY; MANY-CORE ARCHITECTURE; MATLAB CODE; MEMORY HIERARCHY; MEMORY LOCALITY; MULTI CORE; PROGRAM TRANSFORMATIONS; REUSE DISTANCE; SCALAR VALUES; UNSOLVED PROBLEMS;

ALGORITHMS; INTELLIGENT CONTROL; LINGUISTICS; MICROPROCESSOR CHIPS; PROGRAM COMPILERS; QUERY LANGUAGES; STRUCTURED PROGRAMMING;

HIGH LEVEL LANGUAGES;

EID: 77954699826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810085.1810125     Document Type: Conference Paper

References (24)

1. P. S. Abrams. An APL Machine. Doctoral dissertation, Stanford University, Stanford Linear Accelerator Center, Stanford, California, USA, Feb. 1970.
2. AMD Core Math Library (ACML). On the web. http: //developer.amd.com/ tools/acml/Pages/default.aspx.
3. D. F. Bacon, S. L. Graham, and O. J. Sharp. Compiler Transformations for High-Performance Computing. ACM Computing Surveys, 26(4):345-420, Dec. 1994.
4. K. Beyls and E. H. D'Hollander. Refactoring for Data Locality. Computer, 42(2):62-71, Feb. 2009.
5. N. Birkbeck, J. Levesque, and J. N. Amaral. A Dimension Abstraction Approach to Vectorization in Matlab. In Proceedings of the International Symposium on Code Generation and Optimization (CGO), pages 115-130, 2007.
6. C. Caşcaval and D. A. Padua. Estimating Cache Misses and Locality Using Stack Distances. In Proceedings of the 17th Annual International Conference on Supercomputing (ICS), pages 150-159, 2003.
7. A. Chauhan and K. Kennedy. Reducing and Vectorizing Procedures for Telescoping Languages. International Journal of Parallel Programming, 30(4):291-315, Aug. 2002.
8. C. Ding and K. Kennedy. The Memory Bandwidth Bottleneck and its Amelioration by a Compiler. In Proceedings of the 14th IEEE International Parallel and Distributed Processing Symposium, 2000.
9. C. Ding and Y. Zhong. Predicting Whole-Program Locality through Reuse Distance Analysis. In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pages 245-257, 2003.
10. M. Frigo and S. G. Johnson. FFTW: An Adaptive Software Architecture for the FFT. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, 1998.
11. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-Oblivious Algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999.
12. The GOTO BLAS. On the web. http://www.tacc.utexas.edu/resources/software/ #blas.
13. P. Gottschling, D. S. Wise, and M. D. Adams. Representation-Transparent Matrix Algorithms with Scalable Performance. In Proceedings of the 21st Annual International Conference on Supercomputing (ICS), pages 116-125, 2007.
14. Intel Math Kernel Library. On the web. http://www.intel. com/cd/software/products/asmo-na/eng/307757.htm.
15. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Caşcaval. How Much Parallelism is There in Irregular Applications? In Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 3-14, 2009.
16. R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation techniques for storage hierarchies. IBM Systems Journal, 9(2):78-117, 1970.
17. C. C. McGeoch. Experimental Algorithmics. Communications of the ACM, 50(11):27-31, Nov. 2007.
18. L. D. Rose and D. Padua. Techniques for the Translation of MATLAB Programs into Fortran 90. ACM Transactions on Programming Languages and Systems, 21(2):286-323, Mar. 1999.
19. G. Roth and K. Kennedy. Dependence Analysis of Fortran90 Array Syntax. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'96), 1996.
20. C.-Y. Shei, A. Chauhan, and S. Shaw. Compile-time disambiguation of MATLAB types through concrete interpretation with automatic run-time fallback. In Proceedings of the 16th annual IEEE International Conference on High Performance Computing (HiPC), 2009.
21. R. van Beusekom. A Vectorizer for Octave. Masters thesis, technical report number INF/SRC-04-53, Utrecht University, Center for Software Technology, Institute of Information and Computing Sciences, Utrecht, The Netherlands, Feb. 2005.
22. R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. In Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (SC '98), 1998.
23. M. E. Wolf and M. S. Lam. A Data Locality Optimizing Algorithm. In Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, pages 30-44, 1991.
24. K. Yotov, T. Roeder, K. Pingali, J. Gunnels, and F. Gustavson. An Experimental Comparison of Cache-Oblivious and Cache-Conscious Programs. In Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 93-104, 2007.