400 search results - page 27 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
121
Voted
IISWC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
161
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
120
Voted
IJPP
2010
15 years 2 months ago
2010
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
PPOPP
2010
ACM
16 years 23 days ago
2010
ACM
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
224
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...