Keshav Pingali and Gianfranco Bilardi. Optimal control dependence and the roman chariots problem. ACM Transactions on Programming Languages and Systems, 19(3):462-491, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
SUDS: Automatic Parallelization for Raw Processors - Frank (2003) (Correct)
....dominates w and x #= w. The dominance frontier of a node x is the set of all edges v w such that x dominates v, but does not strictly dominate w [75] The original work on dominance frontiers used the set of nodes w, but the edge formulation is more accurate and more useful. See, for example, [92]. In Figure 7 node 6 dominate nodes 10, 14 and 15, but does not strictly dominate any of nodes 6, 3 or end, so the dominance frontier of node 6 is the edges 10 6, 14 3 and end. The postdominance frontier of node x is the set of all edges v w such that x postdominates w, but does not ....
Keshav Pingali and Gianfranco Bilardi. Optimal control dependence and the roman chariots problem. ACM 19(3), May 1997.
Efficient Computation of Interprocedural Control Dependence - Ezick, Bilardi, Pingali Self-citation (Pingali Bilardi) (Correct)
....extended by Podgurski and Clarke who distinguished between several notions of control dependence [25] Bilardi and Pingali [3] proposed a generalized framework to unify many different such notions. Most of the research in this area has focused on computing intraprocedural control dependence [8, 24, 6, 26, 27]. In this approach, each procedure is treated in isolation, by ignoring transfer of control due to procedure calls and returns. While adequate for some applications such as instruction scheduling, ignoring calls and returns is not an option for other applications such as interprocedural dataflow ....
....case, a key step toward control dependence computation is the construction of the transitive reduction of the postdominance relation. This reduced relation is tree structured, a fact that is crucially exploited both in computing it [19, 4] and in using it for control dependence computations [24]. In the interprocedural case, the transitive reduction of postdominance is not necessarily a tree, so that these intraprocedural algorithms can no longer be used. The key point, to be discussed more closely in Section 2, is that while all graph theoretic paths in the intraprocedural control flow ....
[Article contains additional citation context not shown here]
K. Pingali and G. Bilardi. Optimal control dependence and the roman chariots problem. ACM Transactions on Programming Languages and Systems, 19(3):1--30, May 1997.
Interprocedural Dataflow Analysis - Alias Analysis - Sathyanathan (2001) (1 citation) (Correct)
No context found.
Keshav Pingali and Gianfranco Bilardi. Optimal control dependence and the roman chariots problem. ACM Transactions on Programming Languages and Systems, 19(3):462-491, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC