Title :
Practical hypercube algorithms for computational geometry
Author :
MacKenzie, Philip D. ; Stout, Quentin F.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
Abstract :
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
Keywords :
computational geometry; parallel algorithms; 2-D divide-and-conquer; computational geometry; cross-stitching technique; hypercube algorithms; Computational geometry; Computer architecture; Concurrent computing; Euclidean distance; Hypercubes; Laboratories; Nearest neighbor searches; Parallel machines; Phase change random access memory;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
Conference_Location :
College Park, MD
Print_ISBN :
0-8186-2053-6
DOI :
10.1109/FMPC.1990.89442
