Banerjee inequality

=?ISO-8859-1?Q?Pertti_Kellom=E4ki?= <pertti.kellomaki@tut.fi>
Fri, 02 Nov 2007 11:32:01 +0200

          From comp.compilers
Related articles
Banerjee inequality pertti.kellomaki@tut.fi (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-02)
Re: Banerjee inequality rcmetzger@grandecom.net (rcmetzger) (2007-11-04)
Re: Banerjee inequality jle@ural.owlnet.rice.edu (2007-11-05)
Re: Banerjee inequality gneuner2/@/comcast.net (George Neuner) (2007-11-05)
Re: Banerjee inequality pertti.kellomaki@tut.fi (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-06)
Re: Banerjee inequality pertti.kellomaki@tut.fi (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-08)
| List of all articles for this month |
From: =?ISO-8859-1?Q?Pertti_Kellom=E4ki?= <pertti.kellomaki@tut.fi>
Newsgroups: comp.compilers
Date: Fri, 02 Nov 2007 11:32:01 +0200
Organization: Compilers Central
Keywords: analysis, question
Posted-Date: 02 Nov 2007 10:28:52 EDT

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?
--
Pertti


Post a followup to this message

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