6542 search results - page 52 / 1309 » The tao of parallelism in algorithms |
EUROPAR
2006
Springer
14 years 17 days ago
2006
Springer
Writing irregular parallel algorithms with OpenMP has been rarely practised in the past. Yet it is possible, and in this paper we will use a simple breadth
HIPC
2005
Springer
14 years 2 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
13 years 8 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...
EUSFLAT
2003
13 years 10 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
14 years 1 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...