528 search results - page 58 / 106 » A Parallel Version for the Propagation Algorithm |
141
Voted
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
152
click to vote
DEBS
2010
ACM
15 years 6 months ago
2010
ACM
We present a case study parallelizing streaming aggregation on three different parallel hardware architectures. Aggregation is a performance-critical operation for data summarizat...
161
click to vote
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
110
Voted
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
183
click to vote
EUROPAR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...