Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form
ACM Transactions on Programming Languages and Systems (TOPLAS)
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
ICS '95 Proceedings of the 9th international conference on Supercomputing
Idiom recognition in the Polaris parallelizing compiler
ICS '95 Proceedings of the 9th international conference on Supercomputing
Detection and global optimization of reduction operations for distributed parallel machines
ICS '96 Proceedings of the 10th international conference on Supercomputing
Array SSA form and its use in parallelization
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Adaptive reduction parallelization techniques
Proceedings of the 14th international conference on Supercomputing
Time Stamp Algorithms for Runtime Parallelization of DOACROSS Loops with Dynamic Dependences
IEEE Transactions on Parallel and Distributed Systems
Parallel Programming with Polaris
Computer
On the Automatic Parallelization of Sparse and Irregular Fortran Programs
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
A compiler framework to detect parallelism in irregular codes
LCPC'01 Proceedings of the 14th international conference on Languages and compilers for parallel computing
| Hi-index | 0.00 |
This paper presents a new algorithm for the detection of coarse-grain parallelism in loops with complex irregular computations. Loops are represented as directed acyclic graphs whose nodes are the strongly connected components (SCC) that appear in the Gated Single Assignment (GSA) program form, and whose edges are the use-def chains between pairs of SCCs. Loops that can be executed in parallel using run-time support are recognized at compile-time by performing a demand-driven analysis of the corresponding SCC graphs. A prototype was implemented using the infrastructure provided by the Polaris parallelizing compiler. Encouraging experimental results for a suite of real irregular programs are shown.