Sciweavers

SPAA
1992
ACM
15 years 28 days 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. ...
SPAA
1992
ACM
15 years 28 days 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
SPAA
1992
ACM
15 years 28 days 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...