Superoptimizers (was Re: Effectiveness of compilers today)

drw@zermelo.mit.edu (Dale R. Worley)
Thu, 18 Feb 1993 17:01:35 GMT

          From comp.compilers
Related articles
Effectiveness of compilers today andreasa@dhhalden.no (1993-02-14)
Re: Effectiveness of compilers today preston@dawn.cs.rice.edu (1993-02-18)
Superoptimizers (was Re: Effectiveness of compilers today) drw@zermelo.mit.edu (1993-02-18)
Re: Superoptimizers (was Re: Effectiveness of compilers today) preston@dawn.cs.rice.edu (1993-02-19)
Re: Superoptimizers (was Re: Effectiveness of compilers today) pardo@cs.washington.edu (1993-02-21)
| List of all articles for this month |
Newsgroups: comp.compilers
From: drw@zermelo.mit.edu (Dale R. Worley)
Keywords: optimize
Organization: MIT Dept. of Tetrapilotomy, Cambridge, MA, USA
References: 93-02-082 93-02-095
Date: Thu, 18 Feb 1993 17:01:35 GMT

preston@dawn.cs.rice.edu (Preston Briggs) writes:
      Unfortunately, [superoptimizers] have somewhat limited
      applicability. You can use them to find nice translations of
      particular idioms that programmers _might_ use; but wouldn't it be
      nice to attack the code that the programmer really did write (e.g.,
      most programs multiply by 4 and 8, easy cases; very few programs
      multiply by 123456789).


I've wondered if it's possible to have a program grovel the ASTs of a
bunch of programs and extract out "common" combinations of operations that
should be candidates for superoptimizer investigation.


Dale Worley Dept. of Math., MIT drw@math.mit.edu
--

Post a followup to this message

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