The use of the cross-stitching technique to solve problems in computational geometry on the hypercube is discussed. Given n inputs distributed one per processor on a hypercube with n processors. The cross-stitching paradigm runs in Θ(log2 n) time with very low constants. This form of 2-D divide-and-conquer is illustrated, some of its applications are considered, and its practicality is shown by the computation of exact communication constants for the authors' algorithms
Published in:
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
Date of Conference:
8-10 Oct 1990
- Page(s):
-
75
-
78
- Meeting Date :
-
08 Oct 1990-10 Oct 1990
- Print ISBN:
-
0-8186-2053-6
- INSPEC Accession Number:
-
3908232
- Conference Location :
-
College Park, MD
- Digital Object Identifier :
-
10.1109/FMPC.1990.89442
- Product Type:
-
Conference Publications