Related articles |
---|
Theory on loop transformations assmann@karlsruhe.gmd.de (1993-04-01) |
Re: Theory on loop transformations jjan@cs.rug.nl (1993-04-02) |
Re: Theory on loop transformations dsehr@gomez.intel.com (1993-04-02) |
Re: Theory on loop transformations pugh@cs.umd.edu (1993-04-03) |
Re: Theory on loop transformations wei@cs.cornell.EDU (Wei Li) (1993-04-03) |
Re: Theory on loop transformations mehrotra@csrd.uiuc.edu (1993-04-04) |
Re: Theory on loop transformations wei@cs.cornell.EDU (Wei Li) (1993-04-06) |
Newsgroups: | comp.compilers |
From: | dsehr@gomez.intel.com (David Sehr) |
Keywords: | optimize, theory |
Organization: | Architecture & Software Technology, Intel Corp, Santa Clara, CA |
References: | 93-04-006 |
Date: | Fri, 2 Apr 1993 16:31:04 GMT |
Uwe Assmann (assmann@karlsruhe.gmd.de) wrote:
> I remember that M. Wolfe (and probably others) have tried to develop a
> theory on loop transformations that looked at the loop transformation as a
> matrix.
A colleague here at Intel has been working on exactly that problem for
several years. His name is Utpal Banerjee, and he has recently
published a book describing the approach you mention (using unimodular
matrices for dependence testing and transformation). The full info:
Loop Transformations for Restructuring Compilers: the Foundations
Utpal Banerjee
Kluwer Academic Publishers
ISBN: 0-7923-9318-X
Other possibilities to pursue are the recent papers of William Pugh of
the University of Maryland (pugh@cs.umd.edu), and Paul Feautrier of the
University of P. et M. Curie (feautrier@masi.ibp.fr).
Hope this helps.
David
--
David C. Sehr, Intel Corporation
2200 Mission College Blvd., M/S RN6-18
Santa Clara, CA 95052-8119
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.