|How to auto-parallelize a binary code? firstname.lastname@example.org (yunzhi) (2009-06-05)|
|Re: How to auto-parallelize a binary code? email@example.com (Louis Krupp) (2009-06-06)|
|Re: How to auto-parallelize a binary code? firstname.lastname@example.org (2009-06-07)|
|Re: How to auto-parallelize a binary code? email@example.com (Jeremy Wright) (2009-06-08)|
|Re: How to auto-parallelize a binary code? firstname.lastname@example.org (George Neuner) (2009-06-08)|
|Re: How to auto-parallelize a binary code? email@example.com (cr88192) (2009-06-12)|
|From:||George Neuner <firstname.lastname@example.org>|
|Date:||Mon, 08 Jun 2009 13:30:22 -0400|
|Organization:||A noiseless patient Spider|
|Posted-Date:||09 Jun 2009 05:33:35 EDT|
On Fri, 5 Jun 2009 23:52:35 -0700 (PDT), yunzhi <email@example.com>
>We have an important single-threaded application. It was developed
>several years ago but the source code is gone. ...
>I do know the single-thread performance will be improved. But how to
>auto-parallelize this binary code? Are there any tools or related
As others have said, rewriting the application is your best bet.
As far as I know there is no current research on auto-parallelizing
native binaries. Back in the 1980's some groups were looking into it,
but rapid advances in single core performance killed interest in the
idea. Virtually all of the tools available now work either at the
source level or at the AST level in the compiler.
If you are desperate for better performance, one thing you might look
into is disassembling the program and re-assembling it to target the
new processor architecture. Modern processors can do a certain amount
of hardware instruction reordering to accommodate older code, but if
you're leaping one or more processor generations, a peephole optimizer
(sometimes called a "window" optimizer) specifically targeted to the
new processor can make a big difference for single core performance.
Return to the
Search the comp.compilers archives again.