Dominator (graph theory)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
1 dom     1 2 3 4 5 6
2 dom 2 3 4 5 6
3 dom 3
4 dom 4
5 dom 5
6 dom 6
Corresponding domination relation
Grey nodes are not strictly dominated
Red nodes are immediately dominated
Example control flow graph with entry node 1.
For Dominating set problem, see Dominating set.

In computer science, in control flow graphs, a node d dominates a node n if every path from the entry node to n must go through d. Notationally, this is written as d dom n (or sometimes d \gg n). By definition, every node dominates itself.

There are a number of related concepts:

  • A node d strictly dominates a node n if d dominates n and d does not equal n.
  • The immediate dominator or idom of a node n is the unique node that strictly dominates n but does not strictly dominate any other node that strictly dominates n. Not all nodes have immediate dominators (e.g. entry nodes don't).
  • The dominance frontier of a node d is the set of all nodes n such that d dominates an immediate predecessor of n, but d does not strictly dominate n. It is the set of nodes where d's dominance stops.
  • A dominator tree is a tree where each node's children are those nodes it immediately dominates. Because the immediate dominator is unique, it is a tree. The start node is the root of the tree.

History[edit]

Dominance was first introduced by Reese T. Prosser in a 1959 paper on analysis of flow diagrams.[1] Prosser did not present an algorithm for computing dominance, which had to wait ten years for Edward S. Lowry and C. W. Medlock.[2] Ron Cytron et al. rekindled interest in dominance in 1989 when they applied it to efficient computation of φ functions, which are used in static single assignment form.[3]

Applications[edit]

Dominators, and dominance frontiers particularly, have applications in compilers for computing static single assignment form. A number of compiler optimizations can also benefit from dominators. The flow graph in this case comprises basic blocks.

Automatic parallelization benefits from postdominance frontiers. This is an efficient method of computing control dependence, which is critical to the analysis.

Memory usage analysis can benefit from the dominator tree to easily find leaks and identify high memory usage.[4]

In hardware systems, dominators are used for computing signal probabilities for test generation, estimating switching activities for power and noise analysis, and selecting cut points in equivalence checking.[5] In software systems, they are used for reducing the size of the test set in structural testing techniques such as statement and branch coverage.[6]

Algorithms[edit]

The dominators of a node n are given by the maximal solution to the following data-flow equations:

\operatorname{Dom}(n_o) = \left \{ n_o \right \}
\operatorname{Dom}(n) = \left ( \bigcap_{p \in \text{preds}(n)}^{} \operatorname{Dom}(p) \right ) \bigcup^{} \left \{ n \right \}

where n_o is the start node.

The dominator of the start node is the start node itself. The set of dominators for any other node n is the intersection of the set of dominators for all predecessors p of n. The node n is also in the set of dominators for n.

An algorithm for direct solution is:

 // dominator of the start node is the start itself
 Dom(n0) = {n0}
 // for all other nodes, set all nodes as the dominators
 for each n in N - {n0}
     Dom(n) = N;
 // iteratively eliminate nodes that are not dominators
 while changes in any Dom(n)
     for each n in N - {n0}:
         Dom(n) = {n} union with intersection over Dom(p) for all p in pred(n)

Direct solution is quadratic in the number of nodes, or O(n2). Lengauer and Tarjan developed an algorithm which is almost linear, but its implementation tends to be complex and time consuming for a graph of several hundred nodes or fewer.[7]

Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy of Rice University describe an algorithm that essentially solves the above data flow equations but uses well engineered data structures to improve performance.[8]

Postdominance[edit]

Analogous to the definition of dominance above, a node z is said to post-dominate a node n if all paths to the exit node of the graph starting at n must go through z. Similarly, the immediate post-dominator of a node n is the postdominator of n that doesn't strictly postdominate any other strict postdominators of n.

See also[edit]

References[edit]

  1. ^ Prosser, Reese T. (1959). "Applications of Boolean matrices to the analysis of flow diagrams". AFIPS Joint Computer Conferences: Papers presented at the December 1–3, 1959, eastern joint IRE-AIEE-ACM computer conference (Boston, MA: ACM): 133–138. 
  2. ^ Lowry, Edward S.; and Medlock, Cleburne W. (January 1969). "Object code optimization". Communications of the ACM 12 (1): 13–22. 
  3. ^ Cytron, Ron; Hind, Michael; and Hsieh, Wilson (1989). "Automatic Generation of DAG Parallelism". Proceedings of the ACM SIGPLAN 89 Conference on Programming Language Design and Implementation: 54–68. CiteSeerX: 10.1.1.50.9287. 
  4. ^ "Dominator Tree". eclipse.org. SAP AG and IBM Corporation. 2008, 2012. Retrieved 21 June 2013. 
  5. ^ Teslenko, Maxim; and Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Proceedings of Design and Test in Europe Conference: 406–411. 
  6. ^ Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Proceedings of Design and Test in Europe Conference: 1168–1173. 
  7. ^ Lengauer, Thomas; and Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems (TOPLAS) 1 (1): 121–141. 
  8. ^ Cooper, Keith D.; Harvey, Timothy J; and Kennedy, Ken (2001). "A Simple, Fast Dominance Algorithm". 

External links[edit]