This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [GCC 4.2 Project] Omega data dependence test
- From: Sebastian Pop <sebastian dot pop at cri dot ensmp dot fr>
- To: Dave Korn <dave dot korn at artimi dot com>
- Cc: "'Dan Kegel'" <dank at kegel dot com>, "'GCC Mailing List'" <gcc at gcc dot gnu dot org>
- Date: Mon, 8 Aug 2005 20:44:10 +0200
- Subject: Re: [GCC 4.2 Project] Omega data dependence test
- References: <42F77CFF.6040606@kegel.com> <SERRANOivwNMB0pNayW0000011f@SERRANO.CAM.ARTIMI.COM>
Dave Korn wrote:
>
> Well, I'll pitch in, because I also wasn't sure at first whether it was
> for real and what it was about, but I think I know now. Did you google
> "bill pugh omega solver" and do some background reading? It didn't take me
> too long to get the basic gist of what they're proposing (or at any rate, to
> _think_ I had got it!).
>
> IIUIC, they want to use a linear-algorithm solver to verify the
Omega is not linear: it has a worst case exponential time. It however
does solves systems of linear (in)equalities, or just linear
constraint systems.
> data-dependence analyses performed by the Bannerjee analyzer by recomputing
> the results from an alternative formulation so as to have a 'second opinion'
> to compare the output of gcc's current analyses against.[*]
>
Yes.