6105 search results - page 308 / 1221 » A Parallel Algorithm for Bound-Smoothing |
182
click to vote
VLDB
1992
ACM
15 years 10 months ago
1992
ACM
We present an approach to dealing with skew in parallel joins in database systems. Our approach is easily implementable within current parallel DBMS, and performs well on skewed d...
168
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
The paper describes the development and performance of parallel algorithms for the discrete element method (DEM) software. Spatial domain decomposition strategy and message passing...
205
click to vote
PACT
2009
Springer
16 years 1 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
167
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Huge energy consumption has become a critical bottleneck for further applying large-scale cluster systems to build new data centers. Among various components of a data center, sto...
178
click to vote
ICPPW
2006
IEEE
16 years 22 days ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...