Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!samsung!zaphod.mps.ohio-state.edu!wuarchive!mit-eddie!snorkelwacker.mit.edu!hsdndev!spdcc!iecc!compilers-sender
From: ted@NMSU.Edu
Newsgroups: comp.compilers
Subject: super optimizers?
Keywords: optimize, design
Message-ID: <9103010025.AA05604@NMSU.Edu>
Date: 1 Mar 91 00:25:27 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: ted@NMSU.Edu
Organization: Compilers Central
Lines: 15
Approved: compilers@iecc.cambridge.ma.us

Does anyone have access to a super optimizer that they could run on a
short code sequence for me?  I have in mind something like the
optimizer described a few years ago in an asplos conference which did
branch and bound search on the set of instruction sequences to find
obscure (and fast) code sequences.


The code sequence i have in mind is 20 instructions long on a 68000
and does not reference memory.  I am happy to have code generated on
any relatively conventional architecture.

thanks
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.