Programming with tiles

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2008, Pages 1-10

  Guo, Jia ^a   Bikshandit, Ganesh ^b   Fraguela, Basilio B ^c   Garzarán, María J ^a   Padua, David ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM INDIA RESEARCH LAB   (India)

^c UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

Data parallel; Locality; Parallel programming; Tiling

Indexed keywords

DATA DISTRIBUTION; DATA LAYOUTS; DATA PARALLEL; DATA TYPE; DYNAMIC PARTITIONING; HIERARCHICALLY TILED ARRAYS; LOCALITY; OBJECT-ORIENTED LANGUAGES; OVERLAPPED TILING; PARALLEL COMPUTATION; PERFORMANCE OF ALGORITHM; TILING;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; METADATA;

PARALLEL PROGRAMMING;

EID: 79959486752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. NAS Parallel Benchmarks. Website. http://www.nas.nasa.gov/Software/NPB/.
2. W. Abu-Sufah, D. J. Kuck, and D. H. Lawrie. On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations. IEEE Trans. Comput., 30(5):341-356, 1981. (Pubitemid 11506029)
3. E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users' Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, third edition, 1999.
4. C. Barton, C. Casçaval, G. Almási, Y Zheng, M. Farreras, S. Chattete, and J. N. Amaral. Shared Memory Programming for Large Scale Machines. In PLDI '06: Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 108-117,2006.
5. P. Bientinesi, J. A. Gunnels, M. E. Myers, E. S. Quintana-Orti, and R. A. van de Geijn. The Science of Deriving Dense Linear Algebra Algorithms. ACM Tram. Math. Softw., 31(1):l-26, Mar. 2005.
6. P. Bientinesi, E. S. Quintana-Orti, and R. A. van de Geijn. Representing linear algebra algorithms in code: the FLAME application program interfaces. ACM Trani. Math. Softw., 31(1):27-59, 2005. (Pubitemid 40557861)
7. G. Bikshandi. Parallel Programming with Hierarchically Tiled Arrays. PhD thesis, UIUC, 2007.
8. G. Bikshandi, J. Guo, D. Hoeflinger, G. Almasi, B. B. Fraguela, M. J. Garzarán, D. Padua, and C. von Praun. Programming for Parallelism and Locality with Hierarchically Tiled Arrays. In PPoPP '06: Proc. of the ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 48-57, 2006.
9. G. Bikshandi, J. Guo, C. von Praun, G. Tanase, B. B. Fraguela, M. J. Garzarán, D. Padua, and L. Rauchwerger. Design and use of htalib - a library for Hierarchically Tiled Arrays. In Proc. of the Intl. Workshop on Languages and Compilers for Parallel Computing, 2006.
10. W Carlson, J. Draper, D. Culler, K. Yelick, E. Brooks, and K. Warren. Introduction to UPC and Language Specification. Technical Report CCS-TR-99-157, IDA Center for Computing Sciences, 1999.
11. R. Chandra, L. Dagum, D. Kohr, D. Maydan, J. McDonald, and R. Menon. Parallel programming in OpenMP. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2001.
12. K. Fatahalian, D. R. Horn, T J. Knight, L. Leem, M. Houston, J. Y Park, M. Erez, M. Ren, A. Aiken, W J. Dally, and P. Hanrahan. Sequoia: programming the memory hierarchy. In Supercomputing '06: Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, page 83, 2006.
13. G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W Otto, J. K. Salmon, and D. W. Walker. Solving Problems on Concurrent Processors. Vol. 1: General Techniques and Regular Problems. Prentice-Hall, Inc., 1988.
14. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cacheoblivious algorithms. In FOCS '99: Proceedings of the 40th Annual Symposium on Foundation? of Computer Science, page 285, 1999.
15. W Gropp, E. Lusk, and A. Skjellum. Using MPI (2nd ed.): Portable Parallel Programming with the Message-Passing Interface. MIT Press, 1999.
16. F. G. Gustavson. High-performance linear algebra algorithms using new generalized data structures for matrices. IBM. Res. Dev., 47(1):31-55, 2003.
17. M. H. Halstead. Elements of Software Science. Elsevier, 1977.
18. S. Hiranandani, K. Kennedy, and C-W. Tseng. Compiler Optimizations for Fortran D on MIMD Distributed-memory Machines. In Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pages 86-100, 1991.
19. S. Hiranandani, K. Kennedy, and C-W. Tseng. Compiling Fortran D for MIMD Distributed-memory Machines. Commun. ACM, 35(8):66-80, 1992.
20. F. Irigoin and R. Triolet. Supernode Partitioning. In POPL '88: Proc. of the 15th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pages 319-329, 1988.
21. A. W Lim, S.-W Liao, and M. S. Lam. Blocking and Array Contraction Across Arbitrarily Nested Loops Using Affine Partitioning. In PPoPP '01: Proc. of the 8th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 103-112, 2001.
22. McCabe. A Complexity Measure. IEEE Transaction? on Software Engineering, 2:308-320, 1976.
23. A. C McKellar and J. E. G. Coffman. Organizing Matrices and Matrix Operations for Paged Memory Systems. Communications of the ACM, 12(3): 153-165, 1969.
24. R. W. Numrich and J. Reid. Co-array Fortran for Parallel Programming. SIGPLANFortran Forum, 17(2):1-31, 1998.
25. E. S. Quintana-Orti and R. A. van de Geijn. Formal Derivation of Algorithms: The Triangular Sylvester Equation. ACM Tram. Math. Softw., 29(2):218-243, 2003.
26. J. Ramanujam and P. Sadayappan. Tiling Multidimensional Iteration Spaces for Nonshared Memory Machines. In Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pages 111-120, 1991.
27. J. Reinders. Intel Threading Building Block. O'Reilly, 2007.
28. J. V. W Reynders, P. J. Hinker, J. C. Cummings, S. R. Atlas, S. Banerjee, W F. Humphrey, S. R. Karmesin, K. Keahey, M. Srikant, and M. D. Tholburn. POOMA: A Framework for Scientific Simulations of Paralllel Architectures. In Parallel Programming in C+ +, pages 547-588. MIT Press, 1996.
29. S. Toledo. Locality of Reference in LU Decomposition with Partial Pivoting. SIAM Journal on Matrix Analysis and Application?, 18(4): 1065-1081, 1997.
30. T. Veldhuizen. Techniques for scientific C++. Technical Report TR542, Department of Computer Science, Indiana University, 2000.
31. R. Whaley, A. Petitet, and J. Dongarra. Automated Empirical Optimizations of Sofware and the ATLAS Project. Parallel Computing, 27(1-2):3-35, 2001. (Pubitemid 32264775)
32. M. E. Wolf and M. S. Lam. A Data Locality Optimizing Algorithm. In Proc. of the Conf on Programming Language Design and Implementation, pages 30-44, 1991.
33. M. Wolfe. More Iteration Space Tiling. In Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing, pages 655-664, 1989.