2609 search results - page 124 / 522 » Optimizing for parallelism and data locality |
128
click to vote
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
122
click to vote
CF
2006
ACM
15 years 6 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
82
Voted
JPDC
2006
15 years 20 days ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
104
Voted
DEXA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
106
click to vote
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
The interest among a geographically distributed user base to mine massive collections of scientific data propels the need for efficient data dissemination solutions. An optimal dat...