Supernode partitioning
François Irigoin, Rémi Triolet · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1988
Supercompilers must reschedule computations defined by nested DO-loops in order to make an efficient use of supercomputer features (vector units, multiple elementary processors, cache memory, etc…). Many rescheduling techniques like loop interchange, loop strip-mining or rectangular partitioning have been described to speedup program execution. We present here a class of partitionings that encompasses previous techniques and provides enough flexibility to adapt code to multiprocessors with two levels of parallelism and two levels of memory.
Cited by 564 works. doi:10.1145/73560.73588
Authors
References
- Theory of Linear and Integer Programming
- Dependence graphs and compiler optimizations
- Optimizing supercompilers for supercomputers
- Automatic discovery of linear restraints among variables of a program
- The Organization of Computations for Uniform Recurrence Equations
- The parallel execution of DO loops
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Automatic loop interchange
- Direct parallelization of call statements
- On fourier’s analysis of linear inequality systems