Eclipse Community Forums: Memory Analyzer » Which algrithm is used for dominator tree calculation?

Help

Home

Home » Eclipse Projects » Memory Analyzer » Which algrithm is used for dominator tree calculation?

Show: Today's Messages :: Show Polls :: Message Navigator

Which algrithm is used for dominator tree calculation? [message #1117321]

Thu, 26 September 2013 10:03

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

Report message to a moderator

Re: Which algrithm is used for dominator tree calculation? [message #1118178 is a reply to message #1117321]

Fri, 27 September 2013 06:22

Krum Tsvetkov

Messages: 164
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

Report message to a moderator

Previous Topic:	What would you do if you could run code on heap dumps?
Next Topic:	reachability / retained set

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

]

Current Time: Sat Apr 27 03:02:28 GMT 2024

.:: Contact :: Home ::.

Breadcrumbs

Sign up to our Newsletter