Author of the publication

Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints.

, , , , , , and . IPDPS, page 37. IEEE Computer Society, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Memory-optimal evaluation of expression trees involving large objects., , , , and . Comput. Lang. Syst. Struct., 37 (2): 63-75 (2011)Memory-Constrained Communication Minimization for a Class of Array Computations., , , , and . LCPC, volume 2481 of Lecture Notes in Computer Science, page 1-15. Springer, (2002)Memory-Constrained Data Locality Optimization for Tensor Contractions., , , , , , , , and . LCPC, volume 2958 of Lecture Notes in Computer Science, page 93-108. Springer, (2003)A Performance Optimization Framework for Compilation of Tensor Contraction Expressions into Parallel Programs., , , , , , , and . IPDPS, IEEE Computer Society, (2002)Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models., , , , , , , , , and 8 other author(s). Proc. IEEE, 93 (2): 276-292 (2005)Space-Time Trade-Off Optimization for a Class of Electronic Structure Calculations., , , , , , , and . PLDI, page 177-186. ACM, (2002)Performance Optimization of a Class of Loops Involving Sums of Products of Sparse Arrays., , , , and . PPSC, (1999)XDIA: improving on the label-free data-independent analysis., , , , , , and . Bioinform., 26 (6): 847-848 (2010)Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints., , , , , , and . IPDPS, page 37. IEEE Computer Society, (2003)Optimization of Memory Usage Requirement for a Class of Loops Implementing Multi-dimensional Integrals., , , and . LCPC, volume 1863 of Lecture Notes in Computer Science, page 350-364. Springer, (1999)