Eclipse Community Forums
Forum Search:

Search      Help    Register    Login    Home
Home » Eclipse Projects » Memory Analyzer » Which algrithm is used for dominator tree calculation?
Which algrithm is used for dominator tree calculation? [message #1117321] Thu, 26 September 2013 06:03 Go to next message
f d is currently offline f d
Messages: 1
Registered: September 2013
Junior Member
Hi!

For my studies I'm writing a paper about heap dump analysis tools.
In the case of the memory analyzer I wonder what algorithm is used for dominator tree calculation?

I looked in the code but couldn't identify the algorithm without having to thoroughly analyze it.
I think the 2 most "popular" algorithms are from Lengauer (1979) [1] and Cooper (2001)[2].

Does anyone which algorithm in particular is used by the MAT?

[1] h**p://www.cc.gatech.edu/~harrold/6340/cs6340_fall2010/Readings/lengauer91jul.pdf
[2] h**p://www.cs.rice.edu/~keith/Embed/dom.pdf


Re: Which algrithm is used for dominator tree calculation? [message #1118178 is a reply to message #1117321] Fri, 27 September 2013 02:22 Go to previous message
Krum Tsvetkov is currently offline Krum Tsvetkov
Messages: 149
Registered: July 2009
Senior Member
Hi,

In MAT we followed the Lengauer & Tarjan algorithm. I guess it could be difficult to recognize it because of our internal structures how objects and their references are represented Smile

Krum
Previous Topic:What would you do if you could run code on heap dumps?
Next Topic:Command Line processing of hprof
Goto Forum:
  


Current Time: Wed Jul 30 19:29:53 EDT 2014

Powered by FUDForum. Page generated in 0.07025 seconds