• Like
  • Save
Dominator tree
Upcoming SlideShare
Loading in...5
×
 

Dominator tree

on

  • 2,232 views

 

Statistics

Views

Total Views
2,232
Views on SlideShare
1,967
Embed Views
265

Actions

Likes
0
Downloads
3
Comments
0

12 Embeds 265

http://funningboy.blogspot.com 158
http://funningboy.blogspot.tw 81
http://funningboy.blogspot.de 10
http://funningboy.blogspot.hk 4
http://funningboy.blogspot.in 3
http://funningboy.blogspot.ca 2
http://funningboy.blogspot.kr 2
http://translate.googleusercontent.com 1
http://funningboy.blogspot.jp 1
http://funningboy.blogspot.com.es 1
http://funningboy.blogspot.be 1
http://funningboy.blogspot.sg 1
More...

Accessibility

Upload Details

Uploaded via as OpenOffice

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Dominator tree Dominator tree Presentation Transcript

    • D(5) = entry; D(1) = exit; D(4) = P(4)UD(4) = D(5)UD(4) = {5,4}; D(3) = P(3)UD(3) = D(5)UD(3) = {5,3}; D(2) = P(2)UD(2) = D(3)UD(2) = {5,3,2}; @ Pre(3) D(1) = P(1)UD(1) = D(5)UD(1) = {5,1}; D(2) = P(2)UD(3) = D(1)UD(2) = {5,,3,2}&{5,1}UD(2) @ Pre(1) = {5,2}
    • Post dominator tree pre order {3,4,5,2,1} post_order {1,4,5,2,3} Dominator tree pre order {5,1,2,3,4} post order {1,2,3,4,5} Feedback cut @ 1 5 1 3 2 4 5 1 3 3 2 4 2
    • A Simple, Fast Dominance Algorithm
    • 1 2 3 6 5 1 2 3 4 6 5 1 2 3 4 6 5 1 2 3 4
      • Thus, the total cost per iteration is O(N + E · D)
        • D is the size ofthe largest Dom set.
        • E is taken over the entire traversal
        • N is traversing the graph to compute the reverse postorder sequence