Sciweavers

SPAA
1992
ACM
15 years 1 months ago
Matching the Bisection Bound for Routing and Sorting on the Mesh
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. ...
53
Voted
SPAA
1992
ACM
15 years 1 months ago
Implementations of Randomized Sorting on Large Parallel Machines
William L. Hightower, Jan Prins, John H. Reif
86
Voted
SPAA
1992
ACM
15 years 1 months ago
Low Contention Load Balancing on Large-Scale Multiprocessors
Maurice Herlihy, Beng-Hong Lim, Nir Shavit
70
Voted
SPAA
1992
ACM
15 years 1 months ago
Separator Based Parallel Divide and Conquer in Computational Geometry
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
63
Voted
SPAA
1992
ACM
15 years 1 months ago
Subset Barrier Synchronization on a Private-Memory Parallel System
A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in...
Anja Feldmann, Thomas R. Gross, David R. O'Hallaro...