Re: Banerjee inequality
- From: jle@xxxxxxxxxxxxxxxxxxxx (Jason Lee Eckhardt)
- Date: Mon, 5 Nov 2007 13:59:07 +0000 (UTC)
=?ISO-8859-1?Q?Pertti_Kellom=E4ki?= <pertti.kellomaki@xxxxxx> 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?
See:
Zima and Chapman, "Supercompilers for Parallel and Vector Computers", 1991.
Chapter 4 and Appendix B.
.
- References:
- Banerjee inequality
- From: Pertti Kellomäki
- Banerjee inequality
- Prev by Date: Re: Looking for LL(k) C grammar
- Next by Date: Re: Banerjee inequality
- Previous by thread: Re: Banerjee inequality
- Next by thread: Re: Banerjee inequality
- Index(es):
Relevant Pages
|
|