456 search results - page 33 / 92 » Compiler Optimizations for Improving Data Locality |
DAWAK
2005
Springer
15 years 3 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
CPHYSICS
2006
14 years 9 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
60
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents the alternatives available to support threadprivate data in OpenMP and evaluates them. We show how current compilation systems rely on custom techniques for im...
95
Voted
MICRO
2006
IEEE
15 years 3 months ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
107
click to vote
PPOPP
2003
ACM
15 years 2 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...