A brief survey of implicit parallelism detection
on Parallel MIMD computation: HEP supercomputer and its applications
Bulldog: a compiler for VLSI architectures
Bulldog: a compiler for VLSI architectures
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
The program dependence graph in static program testing
Information Processing Letters
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Conversion of control dependence to data dependence
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Dependence graphs and compiler optimizations
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The program Dependence Graph and its Use in Optimization
Proceedings of the 6th Colloquium on International Symposium on Programming
The program dependence graph in a software development environment
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Control flow and data flow analysis for the translation of control graphs into data graphs (parallel processing)
Using a competitive learning neural network to evaluate software complexity
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
A unifying theory of control dependence and its application to arbitrary program structures
Theoretical Computer Science
| Hi-index | 0.00 |
The program dependence graph, PDG, is used to represent the data and control dependencies between the statements of some program. The data dependencies between the statements are fully understood and they correspond to the definition-use chain. On the other hand the concept of control dependence is not fully explored. In this paper we formalize and analyze the concept or control dependence and present algorithms to find directly the control dependence subgraph of PDG in &Ogr;(N &agr;(N)), where N is the number of statements in the program.