Re: Memory Analysis

preston@dawn.cs.rice.edu (Preston Briggs)
Mon, 27 Jan 1992 17:47:38 GMT

          From comp.compilers
Related articles
Memory Analysis htf@castle.ed.ac.uk (H T Fallside) (1992-01-27)
Re: Memory Analysis preston@dawn.cs.rice.edu (1992-01-27)
Re: Memory Analysis maydan@Xenon.Stanford.EDU (1992-01-28)
Re: Memory Analysis moss@cs.umass.edu (1992-02-05)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@dawn.cs.rice.edu (Preston Briggs)
Keywords: optimize, vector, bibliography
Organization: Rice University, Houston
References: 92-01-100
Date: Mon, 27 Jan 1992 17:47:38 GMT

In article 92-01-100 H T Fallside <htf@castle.ed.ac.uk> writes:
>Does anyone know of any analysis performed on array accesses and
>techniques to optimise these operations? A typical example would be the
>detection of redundant accesses in iterative loops.


In general, it's called "dependence analysis", from the work in
vectorization. Good recent papers include


Efficient and Exact Dependence Analysis
Mayden, Hennessy, Lam


Practical Dependence Testing
Goff, Kennedy, Tseng


both from Proceedings of the SIGPLAN '91 Conference on
Programming Language Design and Implementation (PLDI).


A paper on using the results of depedence analysis for improving
scalar code (versus it's use in vectorization) is


Improving Register Allocation for Subscripted Variables
Callahan, Carr, Kennedy
Proceeding of the SIGPLAN '90 PLDI




Preston Briggs
--

Post a followup to this message

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