( en | de | ru )

 

Disambiguation of "Sadayappan, P."

Author of the publication

copydeleteadd this publication to your clipboard
When polyhedral transformations meet SIMD code generation.

, , , , , and . PLDI, page 127-138. ACM, (2013)

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.

P Günther

P Kock

P Krebietke

P Narayanan

P Hartmann

 

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)Empirical performance model-driven data layout optimization and library call selection for tensor contraction expressions., , , , , and . J. Parallel Distributed Comput., 72 (3): 338-352 (2012)Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver., , , , , , and . J. Parallel Distributed Comput., 66 (5): 659-673 (2006)Cluster partitioning approaches to mapping parallel programs onto a hypercube., , and . Parallel Comput., 13 (1): 1-16 (1990)Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining., , and . Proc. VLDB Endow., 4 (4): 231-242 (2011)A framework for characterizing overlap of communication and computation in parallel applications., , , , and . Clust. Comput., 11 (1): 75-90 (2008)Multifrontal Factorization of Sparse Matrices on Shared-Memory Multiprocessors., , and . ICPP (3), page 159-166. CRC Press, (1991)Affine transformations for communication minimal parallelization and locality optimization of arbitrarily nested loop sequences, , , , , and . OSU-CISRC-5/07-TR43. The Ohio State University, (May 2007)One-to-one mapping of process graphs onto a hypercube., and . ICS, page 91-98. ACM, (1989)Communication Efficient Matrix Multiplication on Hypercubes., and . SPAA, page 320-329. ACM, (1994)