6105 search results - page 74 / 1221 » A Parallel Algorithm for Bound-Smoothing |
112
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
124
click to vote
HPCC
2010
Springer
15 years 2 months ago
2010
Springer
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
123
click to vote
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
94
Voted
PODC
2009
ACM
15 years 9 months ago
2009
ACM
72
Voted
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
