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.
2016
2016
Surface Solutions Using Data Virtualization and Big Data
2015
2015
Is superoptimization viable for VM instruction sets?
The technique of superoptimization attempts to ensure true optimality of a code (according to predefined criteria) through an… 
2015
2015
Superoptimized Memory Subsystems for Streaming Applications
Because main memory is many times slower than modern processor cores, deep, multi-level cache hierarchies are ubiquitous in… 
2015
2015
Superoptimizing Memory Subsystems for Multiple Objectives
We consider the automatic determination of application-specific memory subsystems via superoptimization, with the goals of… 
2015
2015
Superoptimizer Construction Framework with Efficient Hybrid Search
A superoptimizer searches for an optimal implementation for a given input program in a target instruction set architecture (ISA… 
2015
2015
Application-Specific Memory Subsystems
OF THE DISSERTATION Application-Specific Memory Subsystems by Joseph G. Wingbermuehle Doctor of Philosophy in Computer Science… 
2014
2014
Superoptimization of memory subsystems
The disparity in performance between processors and main memories has led computer architects to incorporate large cache… 
2011
2011
Using Binary Decision Diagrams to Determine Program Equivalence in a Superoptimizer.
A superoptimizer is a tool capable of generating an optimal program that computes a desired function. This thesis describes a… 
1993
1993
A massively parallel optimizer for expression evaluation
A number of “tricks” are known that trade multiplications for additions. The term “tricks” reflects the way these methods seem… 
1992
1992
A polynomial J-spectral factorization solution to H∞ superoptimization
The H<sub>∞</sub>-superoptimization control problem is solved, via size reduction, as a sequence of standard H<sub>∞</sub… 
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)