Compiler Algorithms for Synchronization
From MaRDI portal
Publication:3763579
DOI10.1109/TC.1987.5009499zbMATH Open0627.68024OpenAlexW1976611694WikidataQ123362765 ScholiaQ123362765MaRDI QIDQ3763579FDOQ3763579
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
Recommendations
transformationsparallel processingmultiprocessorsFortranprogram loopsprogram restructuringconcurrent loopconcurrentizing compilersloop synchronization techniques
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)