Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,185,699 papers from all fields of science
Search
Sign In
Create Free Account
Loop interchange
In compiler theory, loop interchange is the process of exchanging the order of two iteration variables used by a nested loop. The variable used in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Array data structure
Automatic vectorization
CPU cache
Dependence analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Solving Batched Linear Programs on GPU and Multicore CPU
Amit Gurung
,
Rajarshi Ray
arXiv.org
2016
Corpus ID: 3815961
Linear Programs (LPs) appear in a large number of applications and offloading them to the GPU is viable to gain performance…
Expand
2015
2015
Multi-tier Dynamic Vectorization for Translating GPU Optimizations into CPU Performance
Heehoon Kim
,
I. E. Hajj
,
John A. Stratton
,
Wen-mei W. Hwu
,
stratton
2015
Corpus ID: 17247330
Developing high performance GPU code is labor intensive. Ideally, developers could recoup high GPU development costs by…
Expand
2011
2011
Automatic Loop Tiling for Direct Memory Access
Haibo Lin
,
Tao Liu
,
+4 authors
Ling Shao
IEEE International Parallel and Distributed…
2011
Corpus ID: 4306287
In heterogeneous multi-core systems, such as the Cell BE processor, each accelerator core has its own fast local memory without…
Expand
2005
2005
Compiler transformations for effectively exploiting a zero overhead loop buffer
Gang-Ryung Uh
,
Yuhong Wang
,
+4 authors
C. Burns
Software, Practice & Experience
2005
Corpus ID: 5374616
A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be…
Expand
2005
2005
Parameterization and Search-space Exploitation of Loop Fusion
Yuan Zhao
,
Qing Yi
,
K. Kennedy
,
D. Quinlan
,
R. Vuduc
2005
Corpus ID: 13797130
Traditional compilers are limited in their ability to optimize applications for different architectures because statically…
Expand
2004
2004
Improving locality for ODE solvers by program transformations
T. Rauber
,
G. Rünger
Scientific Programming
2004
Corpus ID: 45098172
Runge-Kutta methods are popular methods for the solution of ordinary differential equations and implementations are provided by…
Expand
2003
2003
A so llem llution of the Cache Ping-Pong Prob in Multiprocessor Systems
Mi Lu
2003
Corpus ID: 27825514
The cache ping-pong problem arises often in parallel processing systems where each processor has its own local cache and employs…
Expand
2003
2003
Locality and Parallel Optimizations for Parallel Supercomputing
Ian Harrison
2003
Corpus ID: 14774457
Although processor speeds have been increasing rapidly over the past decade, the speed of memory has failed to keep pace. Memory…
Expand
1998
1998
Loop bounds computation for multilevel tiling
M. Jiménez
,
J. Llabería
,
Agustín Fernández
International Euromicro Conference on Parallel…
1998
Corpus ID: 20756292
The paper focuses on the complexity of computing exact loop bounds in multilevel tiling. Conventional tiling techniques implement…
Expand
1992
1992
Optimizing Loops in Database Programming Languages
D. Lieuwen
,
D. DeWitt
International Workshop/Symposium on Database…
1992
Corpus ID: 14178734
Database programming languages like O2, E, and O++ include the ability to iterate through a set. Nested iterators can be used to…
Expand
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)
ACCEPT & CONTINUE