Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Loop unswitching

Loop unswitching is a compiler optimization. It moves a conditional inside a loop outside of it by duplicating the loop's body, and placing a version… Expand
Wikipedia

Related topics

Related topics

3 relations
GNU Compiler CollectionLoop optimizationOptimizing compiler

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Refactoring Loops with Nested IFs for SIMD Extensions Without Masked Instructions
Most CPUs in heterogeneous systems are now equipped with SIMD (Single Instruction Multiple Data) extensions that operate on short… Expand
2017
2017
Context-aided analysis of community evolution in networks
We are interested in detecting and analyzing global changes in dynamic networks (networks that evolve with time). More precisely… Expand
2017
2017
A compiler transformation-based approach to scientific workflow enactment
We investigate in this paper the application of compiler transformations to workflow applications using the Manycore Workflow… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
2017
2017
Taming undefined behavior in LLVM
A central concern for an optimizing compiler is the design of its intermediate representation (IR) for code. The IR should make… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 6
2012
2012
A New Optimal Space-Vector Modulation Technique for Three-Phase Voltage Source Inverters
In this paper, a new optimal space-vector pulse- width modulation (SVPWM) technique is presented for three-phase voltage source… Expand
  • figure 1
  • figure 4
  • table I
  • table II
  • figure 3
Highly Cited
2010
Highly Cited
2010
A compiler framework for the reduction of worst-case execution times
The current practice to design software for real-time systems is tedious. There is almost no tool support that assists the… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • table 2
2009
2009
Accelerating WCET-driven optimizations by the invariant path paradigm: a case study of loop unswitching
The worst-case execution time (WCET) being the upper bound of the maximum execution time corresponds to the longest path through… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
2009
2009
Chunking parallel loops in the presence of synchronization
Modern languages for shared-memory parallelism are moving from a bulk-synchronous Single Program Multiple Data (SPMD) execution… Expand
  • figure 4
  • figure 6
  • figure 7
  • figure 9
  • figure 10
Highly Cited
2009
Highly Cited
2009
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
2006
2006
Observation-Switching Linear Dynamic Systems for Tracking Humans Through Unexpected Partial Occlusions by Scene Objects
This paper focuses on the problem of tracking people through occlusions by scene objects. Rather than relying on models of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE