6542 search results - page 292 / 1309 » The tao of parallelism in algorithms |
167
click to vote
EUROPAR
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factor...
175
click to vote
ICCS
2004
Springer
16 years 4 days ago
2004
Springer
We show in this paper how to evaluate the performance of skeleton-based high level parallel programs. Since many applications follow some commonly used algorithmic skeletons, we id...
196
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
163
click to vote
AAAI
2010
15 years 8 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
183
click to vote
PPSC
1997
15 years 8 months ago
1997
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and atte...