Path: utzoo!attcan!uunet!husc6!think!bloom-beacon!tut.cis.ohio-state.edu!mailrus!iuvax!pur-ee!uiucdcs!uxc.cso.uiuc.edu!urbsdc!aglew
From: aglew@urbsdc.Urbana.Gould.COM
Newsgroups: comp.arch
Subject: Re: m88000 benchmarks (and C vs ASM
Message-ID: <28200167@urbsdc>
Date: 20 Jun 88 16:16:00 GMT
References: <2434@winchester.mips.COM>
Lines: 12
Nf-ID: #R:winchester.mips.COM:2434:urbsdc:28200167:000:638
Nf-From: urbsdc.Urbana.Gould.COM!aglew    Jun 20 11:16:00 1988


>The problem with writing a scheduler is finding an efficient (read: heuristic)
>method of traversing the code graph. The simplest method produces the best code
>at exponential compilation time: try every possible sequence. The grief is
>trying to find a linear to quadratic time method which still gives a good
>sequence.

Do any compilers contain the simple, brute-force, exponential algorithm,
to be turned on when you are willing to spend the time, or when the graph
for a procedure is small enough?
    There was a paper, an ASPLOS back, on "Super-Optimizer", a brute force
searcher. It might be nice to have that in your toolbox...