papers on symbolic dependency analysis

Graham Jones <gxj@dcs.ed.ac.uk>
Fri, 29 Jul 1994 10:13:09 GMT

          From comp.compilers
Related articles
papers on symbolic dependency analysis gxj@dcs.ed.ac.uk (Graham Jones) (1994-07-29)
Re: papers on symbolic dependency analysis laurent.Challier@inria.fr (1994-08-01)
Re: papers on symbolic dependency analysis smryan@netcom.com (1994-08-02)
| List of all articles for this month |
Newsgroups: comp.compilers
From: Graham Jones <gxj@dcs.ed.ac.uk>
Keywords: analysis, question
Organization: Department of Computer Science, University of Edinburgh
Date: Fri, 29 Jul 1994 10:13:09 GMT

In M. Haghighat and C. Polychronopoulos paper "Symbolic Dependence
Analysis for High Performance Parallelising Compilers, Advances in
Languages and Compilers for Parallel Processing, 1991" the authors
indicate the large number of arrays with symbolic subscripts. Classical
dependency tests fail in the presence of symbolic terms but can be
assisted by global constant propagation, forward and induction variable
substitution. Does anyone know of the number of cases that still remain
unanalysable after these optimisations have taken place ? Given that some
subsripts can still not be analysed, we need to develop symbolic
dependency tests to handle these cases. Does anyone know of any current
work and useful papers in this area ?


I will post any replies to the news group.


  ---------------------------------------
  Graham P. Jones
  Address: Room 3419,
The University Of Edinburgh,
Kings Buildings,
West Mains Road,
Edinburgh EH9 3JY
  Tel : 031-650-5118
--

Post a followup to this message

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