Sciweavers

456 search results - page 38 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
SC
1995
ACM
15 years 1 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
SAIG
2001
Springer
15 years 2 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
ML
2010
ACM
14 years 8 months ago
Semi-supervised local Fisher discriminant analysis for dimensionality reduction
When only a small number of labeled samples are available, supervised dimensionality reduction methods tend to perform poorly due to overfitting. In such cases, unlabeled samples ...
Masashi Sugiyama, Tsuyoshi Idé, Shinichi Na...
HEURISTICS
2008
92views more  HEURISTICS 2008»
14 years 9 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
89
Voted
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 1 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...