Sciweavers

2609 search results - page 40 / 522
» Optimizing for parallelism and data locality
Sort
View
JUCS
2000
120views more  JUCS 2000»
14 years 10 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
VLDB
1995
ACM
132views Database» more  VLDB 1995»
15 years 1 months ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
HPDC
2010
IEEE
14 years 11 months ago
Optimization of a parallel permutation testing function for the SPRINT R package
The statistical language R and Bioconductor package are favoured by many biostatisticians for processing microarray data. The amount of data produced by these analyses has reached...
Savvas Petrou, Terence M. Sloan, Muriel Mewissen, ...
CIKM
2007
Springer
15 years 4 months ago
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
Tao-Young Fu, Wen-Chih Peng, Wang-Chien Lee
CF
2006
ACM
15 years 2 days ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander