7 search results - page 1 / 2 » spaa 1998 |
185
Voted
SPAA
1998
ACM
15 years 9 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
143
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
135
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
We present a computation-centric theory of memory models. Unlike traditional processor-centric models, computation-centric models focus on the logical dependencies among instructi...