Skip to search formSkip to main contentSkip to account menu

Superoptimization

Superoptimization is the process of finding the optimal code sequence for one, loop-free sequence of instructions. It is performed in and by a type… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Answer set programmingBinary translationBrute-force searchClojure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Blockchain Superoptimizer
In the blockchain-based, distributed computing platform Ethereum, programs called smart contracts are compiled to bytecode and… 
2019
2019
Realizing Low-Latency Internet Services via Low-Level Optimization of NFV Service Chains : Every nanosecond counts!
By virtue of the recent technological developments in cloud computing, more applications are deployed in a cloud. Among these… 
2016
2016
GreenThumb: superoptimizer construction framework
Developing an optimizing compiler backend remains a laborious process, especially for nontraditional ISAs that have been… 
2016
2016
Learning to superoptimize programs
  • 2016
  • Corpus ID: 260502973
Superoptimization requires the estimation of the best program for a given compu1 tational task. In order to deal with large… 
2015
2015
Conditionally correct superoptimization
The aggressive optimization of heavily used kernels is an important problem in high-performance computing. However, both general… 
2014
2014
Superoptimization of memory subsystems
The disparity in performance between processors and main memories has led computer architects to incorporate large cache… 
2012
2012
Superoptimization in LLVM
Superoptimization is a known technique to integrate the analyses and transformations of a number of separate optimizations in… 
2008
2008
Peephole superoptimization
The classical meaning of superoptimization is to find the optimal code sequence for a single, loop-free assembly sequence of… 
1996
1996
Generating machine specific optimizing compilers
Most portable compilers ignore the target architecture for optimization phases, deferring the introduction of machine specific… 
Highly Cited
1992
Highly Cited
1992
Eliminating branches using a superoptimizer and the GNU C compiler
In 1987, Henry Massalin, of Columbia University, described a super-optimizer that generates optimal instruction sequences given a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)