Path: utzoo!attcan!uunet!husc6!mailrus!ames!zodiac!joyce!sri-unix!garth!smryan From: smryan@garth.UUCP (Steven Ryan) Newsgroups: comp.arch Subject: Re: m88000 benchmarks (and C vs ASM Message-ID: <773@garth.UUCP> Date: 21 Jun 88 21:05:34 GMT References: <2434@winchester.mips.COM> <28200167@urbsdc> Reply-To: smryan@garth.UUCP (Steven Ryan) Organization: INTERGRAPH (APD) -- Palo Alto, CA Lines: 14 In article <28200167@urbsdc> aglew@urbsdc.Urbana.Gould.COM writes: >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... I remember something like that--the running time was like a week on 10 line program, and even then it has to be handchecked. It would be interesting to combine profilers and optimisers to locate that one innermost loop and then exhaustively enumerate the possible paths. If the loop is small and this is only done once or twice in a large program, the exponential time could be subsumed by rest of the compilation.