6105 search results - page 379 / 1221 » A Parallel Algorithm for Bound-Smoothing |
136
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
135
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
136
click to vote
DEXAW
1997
IEEE
15 years 11 months ago
1997
IEEE
Existing concurrency control algorithms do not well conform to various environments, in the performance perspective. Each algorithm has some assumption on the conflict characteris...
196
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
230
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
A software framework for the parallel execution of sequential programs using C++ classes is presented. The functional language Concurrent ML is used to implement the underlying ha...