Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver

DOI10.1016/J.JPDC.2005.06.017MaRDI QIDQ2497741zbMATH OpenOpenAlexFDO

Authors Sandhya Krishnan, Sriram Krishnamoorthy, Gerald Baumgartner, J. Ramanujam, Venkatesh Choppella, Chi Chung Lam, P. Sadayappan

Publication date 4 August 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.06.017

zbMATH Keywords

tensor contractionsprogram transformationcompiler optimizationdata locality optimizationdiscrete constrained searchout-of-core algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Theory of compilers and interpreters (68N20)

Recommendations

• Languages and Compilers for Parallel Computing
• scientific article; zbMATH DE number 2080886
• scientific article; zbMATH DE number 1760057
• An algorithm for the optimization of finite element integration loops
• scientific article; zbMATH DE number 1460255

Cited in

(3)

• scientific article; zbMATH DE number 2080886 (Why is no real title available?)
• Simulated annealing with asymptotic convergence for nonlinear constrained optimization
• Languages and Compilers for Parallel Computing

Describes a project that uses

Uses Software

• BLAS

This page was built for publication: Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497741)