Abstract
We characterize the transitive closure of the control dependence relation and give an application to the theory of control fow guards. We relate our result to characterizations by Beck et al., by Sarkar, and by Cytron et al., and strengthen a result of the latter concerning dominance frontiers and join sets.
- 1 ALLEN, R., KENNEDY, K., PORTERFIELD, C., AND WARREN, J.D. Conversion of control dependence to data dependence. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages (Austin, Texas, Jan. 1983), SIGPLAN/SIGACT, pp. 177-189. Google Scholar
- 2 BECK, M., JOHNSON, R., AND PINGALI, K. From control flow to dataflow. J. Parallel Distrib. Comput. 12, 2 (June 1991), 118-129. Google Scholar
- 3 BESAW, K. V. Advanced techniques for vectorizing dusty decks. In Proceedings of the Second International Conference on SupQrcomputing, Vol. I (1987), pp. 111-132.Google Scholar
- 4 CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F.K. Efficiently computing static single assignment form and the control dependence graph. Tech. Rep. RC-14756, IBM Watson Research Center, July 1989.Google Scholar
- 5 CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst., 13, 4 (Oct. 1991), 451-490. Google Scholar
- 6 CYTRON, R., FERRANTE, J., AND SARKAR, V. Compact representations for control dependence. In SIGPLAN '90 Conference on Programming Language Design and Implementation (June 1990), pp. 337-351. Google Scholar
- 7 CYTRON, R., FERRANTE, J., AND SARKAR, V. Experiences using control dependence in PTRAN. In Languages and Compilers for Parallel Computing, D. Gelernter, A. Nicolau, and D. Padua, Eds., MIT Press, Cambridge, Mass., 1990, Ch. 11, 186-212. Google Scholar
- 8 FERRANTE, J. AND MACE, M. On linearizing parallel code. In Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages (Jan. 1985), SIGPLAN/SIGACT, pp. 179-190. Google Scholar
- 9 FERRANTE, J., MACE, M., AND SIMONS, B. Generating sequential code from parallel code. In 1988 International Conference on Supercomputing (St. Malo, France, July 1988), pp. 582-592. Google Scholar
- 10 FERRANTE, J., OTTENSTEIN, K. J., AND WARREN, J.D. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst., 9, 3 (July 1987), 319-349. Google Scholar
- 11 GUPTA, R., AND SOFFA, M.L. Region scheduling. In Proceedings of the Second International Conference on Supercomputing, Vol. III, 1987, pp. 141-148.Google Scholar
- 12 HECHT, M.S. Flow Analysis of Computer Programs. North-Holland, Amsterdam, 1977. Google Scholar
- 13 HORWITZ, S., PRINS, J., AND REPS, T. Integrating non-interfering versions of programs. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages (Jan. 1988). Google Scholar
- 14 HORWITZ, S., PRINS, J., AND REPS, T. On the adequacy of program dependence graphs for representing programs. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages (Jan. 1988). Google Scholar
- 15 KENNEDY, K., AND MCKINLEY, K. S. Loop distribution with arbitrary control flow. In Proceedings of Supercomputing "90 (Nov. 1990), pp. 407-416. Google Scholar
- 16 SARKAR, V. PTRAN--the IBM parallel translation system. In Parallel Functional Languages and Compilers, B. K. Szymanski, Ed., ACM Press/Addison-Wesley, 1991, Ch. 8, 309-391. Google Scholar
- 17 SELKE, R.P. Program dependence graphs: A formal treatment. Tech. Rep. COMP TR90-130, Dept. of Computer Science, Rice Univ., Aug. 1990.Google Scholar
- 18 SELKE, R.P. Transforming program dependence graphs. Tech. Rep. COMP TR90-131, Dept. of Computer Science, Rice Univ., Aug. 1990.Google Scholar
- 19 WEISS, M. Control dependence and partial IF-conversion for MIMD architectures. Tech. Rep. CA-8802-0301, Compass, Inc., Feb. 1988.Google Scholar
Index Terms
The transitive closure of control dependence: the iterated join
Recommendations
Transitive Closure of Infinite Graphs and Its Applications
Special issue: selected papers from the eighth international workshop on languages and compilers for parallel computingInteger tuple relations can concisely summarize many types of information gathered from analysis of scientific codes. For example, they can be used to precisely describe which iterations of a statement are data dependent of which other iterations. It is ...
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
COCOA '09: Proceedings of the 3rd International Conference on Combinatorial Optimization and ApplicationsThis paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to compute the transitive closure exist for convex polyhedra only. In presence of non-...
A transitive closure algorithm
AbstractAn algorithm is given for computing the transitive closure of a directed graph in a time no greater thana 1 N 1 n+a 2 n 2 for largen wherea 1 anda 2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph ...








Comments