Compiler Algorithms for Synchronization

DOI10.1109/TC.1987.5009499MaRDI QIDQ3763579zbMATH OpenOpenAlexWikidataFDO

Authors Samuel P. Midkiff, David Padua

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1987.5009499

zbMATH Keywords

transformationsparallel processingmultiprocessorsFortranprogram loopsprogram restructuringconcurrent loopconcurrentizing compilersloop synchronization techniques

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Loop parallelization algorithms: From parallelism extraction to code generation
• scientific article; zbMATH DE number 1218791
• On the parallel complexity of loops
• Publication:4501868
• Publication:4735042

Cited in

(5)

• Exploiting parallelism on a fine-grained MIMD architecture based upon channel queues
• Speedup studies of leading iteration model for non-DO loops in comparison with sequential iteration model
• Extracting synchronization-free slices of operations in perfectly-nested loops
• Program parallelization using synchronized pipelining
• Conversion from data-driven to synchronous execution in loop programs

This page was built for publication: Compiler Algorithms for Synchronization

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