scientific article; zbMATH DE number 2086384

MaRDI QIDQ4736838zbMATH OpenFDO

Authors Alain Darte, Guillaume Huard

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850179.htm

zbMATH Keywords

Automatic ParallelizationComplexityLoop OptimizationProgram TransformationRetiming

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of loop fusion
• Loop parallelization algorithms: From parallelism extraction to code generation
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• scientific article; zbMATH DE number 618313
• scientific article; zbMATH DE number 4121765

Cited in

(7)

• On the complexity of loop fusion
• Alignment and distribution is not (always) NP-hard
• Reliable generation of high-performance matrix algebra
• On the complexity of MMSNP
• Loop parallelization in multi-dimensional Cartesian space
• The number of loci needed for ELOD calculations
• Reducing off-chip memory access via stream-conscious tiling on multimedia applications

This page was built for publication:

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