5640 search results - page 494 / 1128 » Parallelizing the Data Cube |
136
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
It is well known that LDPC decoding is computationally demanding and one of the hardest signal operations to parallelize. Beyond data dependencies that restrict the decoding of a ...
224
click to vote
ARC
2012
Springer
14 years 22 days ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
191
Voted
ICDCN
2012
Springer
14 years 17 days ago
2012
Springer
Synchronization in distributed systems is expensive because, in general, threads must stall to obtain a lock or to operate on volatile data. Transactional memory, on the other hand...
149
click to vote
PDP
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
156
Voted
HPDC
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...