Skip to search formSkip to main contentSkip to account menu

Loop-invariant code motion

Known as: Loop invariant hoisting, Loop hoisting, LICM 
In computer programming, loop-invariant code consists of statements or expressions (in an imperative programming language) which can be moved outside… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
Block (programming)Code bloatCommon subexpression eliminationComputer programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Translation Validation of Loop Invariant Code Optimizations Involving False Computations
Code motion based optimizations are used quite often in electronic design automation (EDA) tools to improve the quality of… 
2014
2014
Offshore container crane systems with robust optimal sliding mode control
Open-sea ship-to-ship transfer operation is an alternative way to avoid port congestion. This process involves a relatively small… 
2008
2008
Compiling and Optimizing Dynamic Parallel Programs
Data parallelism is an array based programming model that achieves massive parallelism through the lock-step execution of… 
2004
2004
Loop Invariant Code Motion in Code Generator
Loop invariant code motion (LICM) is a traditional optimization. In modern compiler,it is normally per-formed by the phases of… 
2002
2002
Vizer : A System to Vectorize Intel x 86 Binaries
Traditional compilers conduct optimizations on intermediate representations derived from high level source code. However, it is… 
2001
2001
Compiling java for high performance and the internet
Java is the first widely accepted language that addresses heterogeneous resources, security, and portability problems, making it… 
1999
1999
Storage assignment using expression tree transformations to generate compact and efficient DSP code
DSP architectures typically provide dedicated memory address generation units and indirect addressing modes with auto-increment… 
1998
1998
Bidirectional Data Flow Analysis in Code Motion: Myth and Reality
Bidirectional data flow analysis has become the standard technique for solving bit-vector based code motion problems in the… 
1996
1996
Combining code motion and scheduling
1994
1994
Optimizing Explicitly Parallel Programs
We present compiler optimization techniques for explicitly parallel programs that communicate through a shared address space. The… 
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)