Loop splitting

Known as: Loop peeling 
Loop splitting is a compiler optimization technique. It attempts to simplify a loop or eliminate dependencies by breaking it into multiple loops… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2017
02419912017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Loop pipelining is widely adopted as a key optimization method in high-level synthesis (HLS). However, when complex memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
2006
2006
In order to provide the best performance for memory accesses in the multimedia extensions that load or store consecutive subwords… (More)
  • figure 3
  • table I
  • table II
  • figure 7
  • figure 10
Is this relevant?
2004
2004
We present the universal two-loop splitting functions that describe the limits of two-loop n-point amplitudes of massless… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2004
2004
The memory bandwidth largely determines the performance of embedded systems. However, very often compilers ignore the actual… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2004
2004
Loops in programs are the source of many optimizations for improving program performance, particularly on modern high-performance… (More)
  • figure 4
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2002
2002
Loops in programs are the source of many optimizations leading to performance improvements, particularly on modern high… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain… (More)
Is this relevant?
1995
1995
Program transformations and algorithm modiications are discussed that reduce execution time for iterative methods for solving… (More)
  • figure 2
Is this relevant?
1993
1993
In a distributed memory multiprocessor, a program’s task is partitioned among the processors to exploit parallelism, and the data… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Many different kinds of loop transformations have been described, such as loop interchange, loop skewing and loop fusion. Each… (More)
  • table 1
  • figure 1
  • figure 4
  • figure 3
Is this relevant?