1007 search results - page 109 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
136
click to vote
CLUSTER
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
140
click to vote
ESTIMEDIA
2007
Springer
15 years 10 months ago
2007
Springer
—Modern compression standards such as H.264, DivX, or VC-1 provide astonishing quality at the costs of steadily increasing processing requirements. Therefore, efficient solution...
166
click to vote
SIAMIS
2011
14 years 11 months ago
2011
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
276
click to vote
ESWA
2008
15 years 4 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
156
click to vote
PDP
2010
IEEE
15 years 9 months ago
2010
IEEE
- We present a parallel conjugate gradient solver for the Poisson problem optimized for multi-GPU platforms. Our approach includes a novel heuristic Poisson preconditioner well sui...