Compiler Algorithms for Synchronization
Samuel Pratt Midkiff, David Padua · IEEE Transactions on Computers · 1987
Translating program loops into a parallel form is one of the most important transformations performed by concurrentizing compilers. This transformation often requires the insertion of synchronization instructions within the body of the concurrent loop. Several loop synchronization techniques are presented first. Compiler algorithms to generate synchronization instructions for singly-nested loops are then discussed. Finally, a technique for the elimination of redundant synchronization instructions is presented.
Cited by 162 works. doi:10.1109/tc.1987.5009499
Authors
References
- Towards a Theory of Parallel Programming
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
- Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
- Optimizing supercompilers for supercomputers
- The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture.
- Advanced compiler optimizations for supercomputers
- High-Speed Multiprocessors and Compilation Techniques
- A pipelined, shared resource MIMD computer
- Speedup of ordinary programs
- Parallel Supercomputing Today and the Cedar Approach