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 10:03 Go to next message
f d is currently offline f dFriend
Messages: 1
Registered: September 2013
Junior Member

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://
[2] h**p://

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

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

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

Current Time: Fri Oct 09 12:35:03 GMT 2015

Powered by FUDForum. Page generated in 0.01888 seconds
.:: Contact :: Home ::.

Powered by: FUDforum 3.0.2.
Copyright ©2001-2010 FUDforum Bulletin Board Software