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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
With the explosion of smartphones and social network services, location-based social networks (LBSNs) are increasingly seen as… 
2014
2014
This paper describes an approach to solving the loop invariant code motion optimisation problem, encountered problems, made… 
2006
2006
Global disparity between views is usually caused by the displacement between cameras, which can be accurately represented by a… 
2004
2004
Loop invariant code motion (LICM) is a traditional optimization. In modern compiler,it is normally per-formed by the phases of… 
2002
2002
Traditional compilers conduct optimizations on intermediate representations derived from high level source code. However, it is… 
1999
1999
We describe a novel approach to performing data dependence analysis for Java in the presence of Java's "non-traditional" language… 
1998
1998
We generalize Knoop et al.'s Lazy Code Motion (LCM) algorithm for partial redundancy elimination so that the generalized version… 
1995
1995
Profile-based optimizations are being used with increasing frequency. Profile information can be used to improve instruction… 
1994
1994
We present compiler optimization techniques for explicitly parallel programs that communicate through a shared address space. The… 
1992
1992
Hal is a High-level Actor-based Language. Hal supports a number of communication mechanisms, local synchronization constraints…