Re: SSA Versus DU-chains: Is the worst case size really different?

Mayan Moudgill <mmoudgill@sandbridgetech.com>
28 Jul 2005 02:30:47 -0400

          From comp.compilers
Related articles
SSA Versus DU-chains: Is the worst case size really different? bageshri@cse.iitb.ac.in (Bageshri Sathe) (2005-07-26)
Re: SSA Versus DU-chains: Is the worst case size really different? mmoudgill@sandbridgetech.com (Mayan Moudgill) (2005-07-28)
Re: SSA Versus DU-chains: Is the worst case size really different? jsinger@cs.man.ac.uk (Jeremy Singer) (2005-08-05)
| List of all articles for this month |
From: Mayan Moudgill <mmoudgill@sandbridgetech.com>
Newsgroups: comp.compilers
Date: 28 Jul 2005 02:30:47 -0400
Organization: Posted via Supernews, http://www.supernews.com
References: 05-07-097
Keywords: analysis
Posted-Date: 28 Jul 2005 02:30:43 EDT

Bageshri Sathe wrote:
> Hello everyone,
>
> All articles which I referred to (Including Wegman and Zadeck's conditional
> constant propagation using SSA and many other technical papers) state that
> SSA is better than DU-chains since its worst case as well as practical
> size is less than number of DU-chains.
>
> But I am unable understand why - especially the worst case.


I'd suggest looking at Richar Johnson's thesis
http://iss.cs.cornell.edu/Publications/Theses/RichardJohnson.pdf


His thesis compares sparse representations (and the CFG), on both
worst-case and actual programs. Net result - (my interpretation) SSAs
don't give very much benefit.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.