|[3 earlier articles]|
|Re: Bit swizzling email@example.com (Kaz Kylheku) (2020-09-05)|
|Re: Bit swizzling firstname.lastname@example.org (davidl...@gmail.com) (2020-09-06)|
|Re: Bit Swizzling email@example.com (Chris) (2020-09-06)|
|Re: Bit swizzling firstname.lastname@example.org (Martin Ward) (2020-09-07)|
|Re: Bit swizzling email@example.com (Rick C. Hodgin) (2020-09-07)|
|Re: Bit swizzling DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-08)|
|Re: Bit swizzling firstname.lastname@example.org (Tom Crick) (2020-09-08)|
|Re: Bit swizzling email@example.com (gah4) (2020-09-10)|
|Re: Bit swizzling firstname.lastname@example.org (Rick C. Hodgin) (2020-09-10)|
|From:||Tom Crick <email@example.com>|
|Date:||Tue, 8 Sep 2020 09:35:29 +0100|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="45397"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||08 Sep 2020 22:34:55 EDT|
On Mon, 7 Sep 2020 at 18:57, Martin Ward <email@example.com> 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:
Still an area with lots of potential (IMHO)...
Return to the
Search the comp.compilers archives again.