Re: Help:Optimisation Algorithms

gelleric@kafka.informatik.uni-stuttgart.de (Wolfgang Gellerich)
27 Feb 1997 00:43:18 -0500

          From comp.compilers

Related articles
Help:Optimisation Algorithms rizzoli@students.uiuc.edu (Alessandro Rizzoli) (1997-02-20)
Re: Help:Optimisation Algorithms gelleric@kafka.informatik.uni-stuttgart.de (1997-02-27)
| List of all articles for this month |

From: gelleric@kafka.informatik.uni-stuttgart.de (Wolfgang Gellerich)
Newsgroups: comp.compilers
Date: 27 Feb 1997 00:43:18 -0500
Organization: Informatik, Uni Stuttgart, Germany
References: 97-02-105
Keywords: optimize

Alessandro Rizzoli <rizzoli@students.uiuc.edu> writes:
|> [ looking for papers on optimization topics]


Concerning loop optimisation, try the following books:


  @BOOK{ zima:91,
      AUTHOR = {H. Zima and B. Chapman},
      TITLE = "{Supercompilers for Parallel and Vector Computers}",
      PUBLISHER = {Addison-Wesley},
      YEAR = {1991}}


@BOOK {wolfe:95,
    AUTHOR = {M.J. Wolfe},
    TITLE = {High-Performance Compilers for Parallel Computing},
    PUBLISHER = {Addison-Wesley},
    YEAR = {1995}}


  @BOOK{ wolfe:89,
      AUTHOR = {M. Wolfe},
      TITLE = "{Optimizing Supercompilers for Supercomputers}",
      PUBLISHER = {The MIT Press},
      COMMENT = {(behandelt Schleifentransformation und benachbarte
                              Gebiete wie die Abh"angigkeitsanalyse von Indexausdr"ucken;
                              viele Beispiele und Literatur"uberblick)},
      YEAR = {1989}}


Regards,


    Wolfgang




+----------------------------------------------------------------------------+
|Wolfgang Gellerich gellerich@informatik.uni-stuttgart.de |
|University of Stuttgart; |
|Informatics Department; Programming Languages Group; |
|Breitwiesenstrasse 20-22; D-70565 Stuttgart; Germany |
|Tel. +49-711-7816213 Fax +49-711-7816380 |
|(Amateur Radio : DJ3TZ@DB0RBS.#BW.DEU.EU) ACM Member No. 4436341 |
--


Post a followup to this message

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