Locality optimization of stencil applications using data dependency graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6548 LNCS, Issue , 2011, Pages 77-91

  Orozco, Daniel ^a   Garcia, Elkin ^a   Gao, Guang ^a  

^a UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE STRUCTURE; COMPUTATION POWER; DATA DEPENDENCIES; DATA DEPENDENCY GRAPHS; EXPERIMENTAL EVIDENCE; FORMAL DESCRIPTION; LOCALITY OPTIMIZATION; MANY-CORE; MANY-CORE ARCHITECTURE; MATHEMATICAL PROOF; MEMORY BANDWIDTHS; MEMORY OPERATIONS; NON-TRADITIONAL; PARALLEL APPLICATION; RUNNING TIME; SOURCE CODES;

PROGRAM COMPILERS;

PARALLEL ARCHITECTURES;

EID: 79952581921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19595-2_6     Document Type: Conference Paper

References (16)

1. del Cuvillo, J., Zhu, W., Hu, Z., Gao, G.R.: Toward a software infrastructure for the cyclops-64 cellular architecture. In: 20th International Symposium on High- Performance Computing in an Advanced Collaborative Environment, HPCS 2006, p. 9 (May 2006) (Pubitemid 44754631)
2. Garcia, E., Venetis, I.E., Khan, R., Gao, G.: Optimized dense matrix multiplication on a many-core architecture. In: D'Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6272, pp. 316-327. Springer, Heidelberg (2010)
3. Irigoin, F., Triolet, R.: Supernode partitioning. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988, pp. 319-329. ACM, New York (1988), http://doi.acm.org/10.1145/73560.73588
4. Krishnamoorthy, S., Baskaran, M., Bondhugula, U., Ramanujam, J., Rountev, A., Sadayappan, P.: Effective automatic parallelization of stencil computations. SIGPLAN Not. 42(6), 235-244 (2007) (Pubitemid 47630691)
5. Lam, M.S.,Wolf, M.E.: A data locality optimizing algorithm. SIGPLAN Not. 39(4), 442-459 (2004)
6. Lim, A.W., Cheong, G.I., Lam, M.S.: An affine partitioning algorithm to maximize parallelism and minimize communication. In: ICS 1999: Proceedings of the 13th International Conference on Supercomputing, pp. 228-237. ACM, New York (1999)
7. Orozco, D., Gao, G.: Diamond Tiling: A Tiling Framework for Time-iterated Scientific Applications. In: CAPSL Technical Memo 91. University of Delaware (2009)
8. Orozco, D., Gao, G.: Mapping the fdtd application for many core processor. In: International Conference on Parallel Processing ICPP (2009)
9. Rajopadhye, S.: Dependence analysis and parallelizing transformations. In: Srikant, Y.N.S., Shankar, P. (eds.) Handbook on Compiler Design, 1st edn. CRC Press, Boca Raton (2002) (in press)
10. Ramanujam, J., Sadayappan, P.: Tiling multidimensional iteration spaces for multicomputers. Journal of Parallel and Distributed Computing 16(2), 108-120 (1992)
11. Schreiber, R., Dongarra, J.: Automatic Blocking of Nested Loops (1990)
12. Shirako, J., Peixotto, D.M., Sarkar, V., Scherer, W.N.: Phasers: a unified deadlockfree construct for collective and point-to-point synchronization. In: ICS 2008, pp. 277-288. ACM, New York (2008)
13. Venetis, I.E., Gao, G.R.: Mapping the LU Decomposition on a Many-Core Architecture: Challenges and Solutions. In: Proceedings of the 6th ACM Conference on Computing Frontiers (CF 2009), Ischia, Italy, pp. 71-80 (May 2009)
14. Wolf, M.E., Lam, M.S.: A data locality optimizing algorithm. SIGPLAN Not. 26(6), 30-44 (1991)
15. Wolfe, M.: More iteration space tiling. In: Supercomputing 1989: Proceedings of the 1989 ACM/IEEE Conference on Supercomputing, pp. 655-664. ACM, New York (1989) (Pubitemid 20665965)
16. Yee, K.: Numerical solution of inital boundary value problems involving maxwell's equations in isotropic media. IEEE Transactions on Antennas and Propagation 14(3), 302-307 (1966)