|Banerjee inequality firstname.lastname@example.org (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-02)|
|Re: Banerjee inequality email@example.com (rcmetzger) (2007-11-04)|
|Re: Banerjee inequality firstname.lastname@example.org (2007-11-05)|
|Re: Banerjee inequality gneuner2/@/comcast.net (George Neuner) (2007-11-05)|
|Re: Banerjee inequality email@example.com (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-06)|
|Re: Banerjee inequality firstname.lastname@example.org (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-08)|
|From:||George Neuner <gneuner2/@/comcast.net>|
|Date:||Mon, 05 Nov 2007 09:47:16 -0500|
On Fri, 02 Nov 2007 11:32:01 +0200, Pertti Kellomdki <email@example.com> wrote:
>I am trying to wrap my head around the Banerjee inequality (a basis
>for a particular form of dependence testing in loops). While I
>understand the gross outline, I am trying to work out the details to
>convince myself. However, the proofs in Allen and Kennedy's Optimizing
>Compilers for Modern Architectures are given in such high level that I
>am having a hard time filling in some of the gaps.
>Does anyone know of sources where the proofs would be spelled
>out in more detail?
You might try:
David Klappholz, Kleanthis Psarris, and Xiangyun Kong, "On the perfect
accuracy of an approximate subscript analysis test", ACM SIGARCH
Computer Architecture News , Proceedings of the 4th international
conference on Supercomputing ICS '90, Volume 18 Issue 3b, June 1990.
Kleanthis Psarris, David Klappholz, and Xiangyun Kong, On the
Accuracy of the Banerjee Test, Journal of Parallel and Distributed
Computing, Special Issue on Shared Memory Multiprocessors, Vol. 12,
No. 2, June 1991.
ACM has the first paper. I haven't found the second one - it came up
in the bibliography of another paper on dependency analysis.
Return to the
Search the comp.compilers archives again.