6105 search results - page 85 / 1221 » A Parallel Algorithm for Bound-Smoothing |
HIPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
INFORMATICALT
2006
14 years 9 months ago
2006
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
111
click to vote
EUSFLAT
2003
14 years 11 months ago
2003
We are trying to piece together the knowledge of evolution with the help of biology, informatics and physics to create complex evolutionary algorithms with parallel and hierarchic...
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—This paper analyzes energy characteristics of parallel algorithms executed on scalable multicore processors. Specifically, we provide a methodology for evaluating energ...