Related articles |
---|
[3 earlier articles] |
Re: Bit swizzling 793-849-0957@kylheku.com (Kaz Kylheku) (2020-09-05) |
Re: Bit swizzling davidlovemore@gmail.com (davidl...@gmail.com) (2020-09-06) |
Re: Bit Swizzling xxx.syseng.yyy@gfsys.co.uk (Chris) (2020-09-06) |
Re: Bit swizzling martin@gkc.org.uk (Martin Ward) (2020-09-07) |
Re: Bit swizzling rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-07) |
Re: Bit swizzling DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-08) |
Re: Bit swizzling tomcrick@gmail.com (Tom Crick) (2020-09-08) |
Re: Bit swizzling gah4@u.washington.edu (gah4) (2020-09-10) |
Re: Bit swizzling rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-10) |
From: | Tom Crick <tomcrick@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Tue, 8 Sep 2020 09:35:29 +0100 |
Organization: | Compilers Central |
References: | 20-09-014 20-09-020 |
Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="45397"; mail-complaints-to="abuse@iecc.com" |
Keywords: | optimize |
Posted-Date: | 08 Sep 2020 22:34:55 EDT |
In-Reply-To: | 20-09-020 |
On Mon, 7 Sep 2020 at 18:57, Martin Ward <martin@gkc.org.uk> wrote:
>
> On 05/09/2020 17:05, Rick C. Hodgin wrote:
> > Are there any existing algorithms which examine the operations that
> > must be conducted and then create an optimized / minimal sequence of
> > mechanical steps to conduct it given a constrained set of features
> > (such as those present on a given CPU)?
>
> The process you are describing is called "Superoptimization":
> finding the optimal code sequence for one loop-free sequence
> of instructions. ...
Back in the distant past (2009), I did my PhD on superoptimisation —
provably optimal code generation using answer set programming:
https://proftomcrick.com/2012/02/18/three-papers-on-superoptimisation/
Still an area with lots of potential (IMHO)...
Best wishes,
Tom
Return to the
comp.compilers page.
Search the
comp.compilers archives again.