On the problem of optimizing parallel programs for complex memory hierarchies

DOI10.1007/BF02939483MaRDI QIDQ1322382zbMATH OpenFDO

Authors Guohua Jin, Fujie Chen

Publication date 12 January 1995

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02939483

zbMATH Keywords

compacted RSRIScomplex memory hierarchiesnested loopsoptimizationparallel compilerparallel processingparallel programregular SRISSRISstaggered reduced iteration space

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 4058853
• An introduction to compilation issues for parallel machines
• scientific article; zbMATH DE number 4121765
• Volume driven selection of loop and data transformations for cache-coherent parallel processors

Cited in

(10)

• A solution of the cache ping-pong problem in multiprocessor systems
• Memory management algorithms for optimistic parallel simulation
• Compiler algorithms for optimizing locality and parallelism on shared and distributed-memory machines
• Volume driven selection of loop and data transformations for cache-coherent parallel processors
• Changing data array dimensions in parallelized algorithms
• Efficient computation of optimal space-time performance curves for memory hierarchies
• scientific article; zbMATH DE number 1196836 (Why is no real title available?)
• scientific article; zbMATH DE number 2090594 (Why is no real title available?)
• Fine-grain parallelization of imperfectly nested loops
• A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing

This page was built for publication: On the problem of optimizing parallel programs for complex memory hierarchies

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