Binary Optimisers are sometimes called "Post Link optimisers". These products can be viewed as "X to X binary translators". Another name is Binary Rewriting systems.
- HP's Dynamo is pretty much the leader in this field
- Wiggins/Redstone is an experimental dynamic optimiser that uses a novel combination of hardware sampling and software instrumentation to dynamically collect hot path information. It is unpublished as of 2001, but there is a series of slides from a presentation at Hot Chips 11, entitled Wiggins/Redstone: An On-line Program Specializer.
- Software Optimization at Link-time And Run-time (SOLAR) at the University of Arizona. From their web page: The SOLAR project is developing binary rewriting techniques for flexible link-time and run-time code optimizations. We are exploring a variety of applications, architectures, and optimization metrics. Applications include traditional sequential programs, parallel scientific programs that use a message passing library such as MPI, and mobile computing applications. We have developed link-time optimizers for the Compaq Alpha and Intel IA-32 (Pentium) architectures, and are building one for the Intel/HP IA-64 (Itanium) architecture.
Optimisers Requiring Source Code (link time or post link). Although these are static optimisers, they rely on special information (profile information or object files) that are not available without the source code to the program being optimised, and so are not really binary translators. They are somewhat related, so they are mentioned here.
- Compaq's spike (see Tru64 Unix Programmer's Guide and search for "spike") is actually a static (but post link) optimiser that can take advantage of profile information. Thus, it's not really a binary translator.
- Alto is a link time optimiser. It is therefore able to see all of the code at once (including libraries). Again, not a binary translator.
Binary program compactors. These systems compact programs to deal with the fact that hard disks are increasing in speed slower than processors are, or that embedded devices often have limited memory.
- Squeeze at the University of Arizona, is a project aimed at reducing the memory footprint for executables on palm sized devices.
- Squeeze++ is an evolution of Sqeeze. It is an example of binary compaction, applying aggressive whole-program optimization and code abstraction techniques on binary programs. Squeeze++ compacted programs are up to 70% smaller and at the same time 20% faster. Squeeze++ is a binary rewriter rather than a binary translator.
CategoryBinaryTranslation