Orchestrating interactions among parallel computations
Susan L. Graham, Steven E. Lucco, Oliver J. Sharp · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1993
Many parallel programs contain multiple sub-computations, each with distinct communication and load balancing requirements. The traditional approach to compiling such programs is to impose a processor synchronization barrier between sub-computations, optimizing each as a separate entity. This paper develops a methodology for managing the interactions among sub-computations, avoiding strict synchronization where concurrent or pipelined relationships are possible.
Cited by 9 works. doi:10.1145/155090.155100 Open-access PDF
Authors
References
- Dependence graphs and compiler optimizations
- Efficiently computing static single assignment form and the control dependence graph
- Software pipelining
- Software pipelining: an effective scheduling technique for VLIW machines
- Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
- Automatic loop interchange
- Allocating Independent Subtasks on Parallel Processors
- PROCESSOR SELF-SCHEDULING FOR MULTIPLE-NESTED PARALLEL LOOPS.
- Compiler optimizations for Fortran D on MIMD distributed-memory machines
- What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation.