Sciweavers

456 search results - page 12 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
SC
2003
ACM
15 years 2 months ago
A Compiler Analysis of Interprocedural Data Communication
This paper presents a compiler analysis for data communication for the purpose of transforming ordinary programs into ones that run on distributed systems. Such transformations ha...
Yonghua Ding, Zhiyuan Li
IJPP
1998
91views more  IJPP 1998»
14 years 9 months ago
Reuse-Driven Tiling for Improving Data Locality
This paper applies unimodular transformations and tiling to improve data locality of a loop nest. Due to data dependences and reuse information, not all dimensions of the iteration...
Jingling Xue, Chua-Huang Huang
PLDI
2005
ACM
15 years 3 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
70
Voted
JUCS
2000
120views more  JUCS 2000»
14 years 9 months ago
Compiler Generated Multithreading to Alleviate Memory Latency
: Since the era of vector and pipelined computing, the computational speed is limited by the memory access time. Faster caches and more cache levels are used to bridge the growing ...
Kristof Beyls, Erik H. D'Hollander
CASES
2007
ACM
14 years 11 months ago
Facilitating compiler optimizations through the dynamic mapping of alternate register structures
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
Chris Zimmer, Stephen Roderick Hines, Prasad Kulka...