SPAA
1998
ACM
14 years 4 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...
SPAA
1998
ACM
14 years 4 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
SPAA
1998
ACM
14 years 4 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
SPAA
1998
ACM
14 years 4 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...
SPAA
1998
ACM
14 years 4 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...
SPAA
1998
ACM
14 years 4 months ago
1998
ACM
SPAA
1998
ACM
14 years 4 months ago
1998
ACM
