Abstract
This paper presents a parallel algorithm for solving grounded range search in associative-function mode using the BSP-like Coarse Grained Multicomputer (CGM). Given a set S of n weighted points in the plane, the algorithm requires O(1) communication rounds (h-relations with h = O(n=p)), O((n=p) log n) local computation, and O(n=p) memory per processor (n=p ≥ p), to solve m = O(n) grounded range search problems. The result implies new or improved solutions to a number of other geometric applications including d-dimensional range search, quadrant search, interval intersection, and chromatic range queries.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.G. Akl and K.A. Lyons, “Parallel Computational Geometry”, Prentice Hall, 1993.
J.L. Bentley, “Multidimensional Divide and Conquer”, Comm. ACM 23(4):214–229, 1980.
G.E. Blelloch, C.E. Leiserson, B.M. Maggs and C.G. Plaxton, “A Comparison of Sorting Algorithms for the Connection Machine CM-2”, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1991, pp. 3–16.
A. Chan, F. Dehne, “A Note on Coarse Grained Parallel Integer Sorting,” Technical Report TR-98-06, School of Computer Science, Carleton University.
F. Dehne, A. Fabri and C. Kenyon, “Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time”, in Proc. 6th IEEE Symp. Parallel and Distributed Processing, 1994, pp. 586–593.
F. Dehne, A. Fabri and A. Rau-Chaplin, “Scalable Parallel Computational Geometry for Coarse Grained Multicomputers”, in Proc. ACM Symp. Computational Geometry, 1993, pp. 298–307.
F. Dehne, X. Deng, P. Dymond, A. Fabri and A.A. Kokhar, “A randomized parallel 3D convex hull algorithm for coarse grained parallel multicomputers”, in Proc.ACM Symp. on Parallel Algorithms and Architectures, 1995.
X. Deng, “A Convex Hull Algorithm for Coarse Grained Multiprocessors”, in Proc. 5th Int. Symp. on Algorithms and Computation, 1994.
X. Deng and P. Dymond, “Efficient Routing and Message Bounds for Optimal Parallel Algorithms”, in Proc. Int. Parallel Proc. Symp., 1995.
X. Deng and N. Gu, “Good Programming Style on Multiprocessors”, in Proc. IEEE Symp. on Parallel and Distributed Processing, 1994, pp. 538–543.
O. Develliers and A. Fabri, “Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers”, (WADS’93), Springer Lecture Notes in Computer Science, 1993, pp. 277–288.
H. Edelsbrunner, “A Note on Dynamic Range Searching”, Bulletin of the EATCS 15:34–40, 1981.
A. Ferreira, A. Rau-Chaplin, S. Ubeda, “Scalable 2D Convex Hull and Triangulation for Coarse Grained Multicomputers”, in Proc. 6th IEEE Symp. on Parallel and Distributed Processing, San Antonio, 1996.
A. Ferreira, C. Kenyon, A. Rau-Chaplin, S. Ubeda, “d-Dimensional Range Search on Multicomputers”, Proc. 11th Int. Parallel Processing Symposium (IPPS’97), April 1997, pp. 616–620.
A.V. Gerbessiotis and L.G. Valiant, “Direct Bulk-Synchronous Parallel Algorithms”, in Proc. 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 621, 1992, pp. 1–18.
R. Cole, “Parallel Merge Sort”, SIAM J. Comp. 17(4):770–785, 1998.
M.T. Goodrich, “Communication Efficient Parallel Sorting”, in Proc. 28th ACM Symp. on Theory of Computing (STOC’96), 1996.
P. Gupta, R. Janardan, M. Smid, “Further results on generalized intsersection searching problems: counting, reporting, dynamization”, J. Algs 19:282–317, 1995.
Janardan, Ravi and Mario Lopez, “Generalized Intersection Searching Problems”, Int. J. Comp. Geom. and Applications 3(1):39–69, 1993.
H. Li and K.C. Sevcik, “Parallel Sorting by Overpartitioning”, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1994, pp. 46–56.
McCreight, E.M., “Priority Search Trees” SIAM J. Comput. 14(2):257–276, 1985.
L.G. Valiant, “A Bridging Model for Parallel Computation”, Comm. ACM 33:103–111, 1990.
L.G. Valiant et. al., “General Purpose Parallel Architectures”, Handbook of Theoretical Computer Science, Edited by J. van Leeuwen, MIT Press/Elsevier, 1990, pp. 943–972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamoureux, M.G., Rau-Chaplin, A. (1999). Parallel Algorithms for Grounded Range Search and Applications. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_74
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive