Global Information Lookup Global Information

Superoptimization information


Superoptimization is the process where a compiler automatically finds the optimal sequence for a loop-free sequence of instructions. Real-world compilers generally cannot produce genuinely optimal code, and while most standard compiler optimizations only improve code partly, a superoptimizer's goal is to find the optimal sequence, the canonical form. Superoptimizers can be used to improve conventional optimizers by highlighting missed opportunities so a human can write additional rules.

and 11 Related for: Superoptimization information

Request time (Page generated in 0.5237 seconds.)

Superoptimization

Last Update:

write additional rules. The term superoptimization was first coined by Alexia Massalin in the 1987 paper Superoptimizer: A Look at the Smallest Program...

Word Count : 859

Program synthesis

Last Update:

specification. However, program synthesis also has applications to superoptimization and inference of loop invariants. During the Summer Institute of Symbolic...

Word Count : 2583

Alexia Massalin

Last Update:

American computer scientist and programmer. She pioneered the concept of superoptimization, and designed the Synthesis kernel, a small kernel with a Unix compatibility...

Word Count : 536

Peephole optimization

Last Update:

optimizer, an early mainframe object code optimizer for IBM Cobol Superoptimization Digital Research XLT86, an optimizing assembly source-to-source compiler...

Word Count : 749

AlphaDev

Last Update:

latency savings. The AlphaDev's performance was compared to stochastic superoptimization, a logical AI approach. The latter was run with at least the same...

Word Count : 1153

Program optimization

Last Update:

improve the result; they have no pretense of producing optimal output. Superoptimization is the process of finding truly optimal output. Optimization can occur...

Word Count : 4487

Binary translation

Last Update:

only at run-time. One such static binary translator uses universal superoptimizer peephole technology (developed by Sorav Bansal and Alex Aiken from Stanford...

Word Count : 2134

Index mapping

Last Update:

Retrieved 26 November 2015. Sayle, Roger Anthony (June 17, 2008). "A Superoptimizer Analysis of Multiway Branch Code Generation" (PDF). Proceedings of the...

Word Count : 314

Multiway branch

Last Update:

[presented earlier] can be implemented as the following:[C example]" "A Superoptimizer Analysis of Multiway Branch Code Generation" by Roger Anthony Sayle...

Word Count : 451

Control table

Last Update:

tables to computer programs by rule mask techniques by P. J. H. King A Superoptimizer Analysis of Multiway Branch Code Generation Archived 27 February 2012...

Word Count : 6465

Multiplicative binary search

Last Update:

pp. 136–141. ISBN 978-0201072563. Sayle, Roger A. (17 June 2008). "A Superoptimizer Analysis of Multiway Branch Code Generation" (PDF). Proceedings of the...

Word Count : 395

PDF Search Engine © AllGlobal.net