Abstract
Given an array of n real numbers A=(a 1, a 2, ..., a n ), define MIN(i, j) = min {a i , ..., a j }. The range minima problem consists of preprocessing array A such that queries MIN(i,j), for any 1≤i≤j≤n, can be answered in constant time. Range minima is a basic problem that appears in many other important problems such as lowest common ancestor, Euler tour, pattern matching with scaling, etc. In this work we present a parallel algorithm under the CGM model (Coarse Grained Multicomputer), that solves the range minima problem in O(n/p) time and constant number of communication rounds.
Supported by FAPESP (Fundação de Amparo à Pesquisa do Estado de São Paulo) -Proc. No. 98/06138-2, and CNPq-Proc. No. 52 3778/96-1 and CAPES.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1975.
N. Alon and B. Schieber. Optimal preprocessing for answering on-line product queries. Technical Report TR 71/87, The Moise and Frida Eskenasy Inst. of Computer Science, Tel Aviv University, 1987.
A. Amir, G. M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Journal of Algorithms, 13:2–32, 1992.
O. Berkman, B. Schieber, and U. Vishkin. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms, 14:344–370, 1993.
O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. Comput., 22(2):221–242, 1993.
E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. ICALP’97, 1997.
F. Dehne, A. Fabri, and C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In Proc. 6th IEEE Symposium on Parallel and Distributed Processing, pages 586–593, 1994.
F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. In Proc. ACM 9th Annual Computational Geometry, pages 298–307, 1993.
F. Dehne and S. W. Song. Randomized parallel list ranking for distributed memory multiprocessors. In Proc. Second Asian Computing Science Conference (ASIAN’96), pages 1–10, 1996.
H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. 16th ACM Symp. On Theory of Computing, pages 135–143, 1984.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2):338–335, 1984.
J. Jájá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, 1992.
R. Lin and S. Olariu. A simple optimal parallel algorithm to solve the lowest common ancestor problem. In Proc. of International Conference on Computing and Information-ICCI’91, number 497 in Lecture Notes in Computer Science, pages 455–461, 1991.
V. L. Ramachandran and U. Vishkin. Efficient parallel triconectivity in logarithmic parallel time. In Proc. of AWOC’88, number 319 in Lecture Notes in Computer Science, pages 33–42, 1988.
J. H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, 1993.
B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput., 17:1253–1262, 1988.
L. G. Valiant. A bridging model for parallel computation. Comm. of the ACM, 33:103–111, 1990.
J. Vuillemin. A unified look at data structures. Comm. of the ACM, 23:229–239, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Mongelli, H., Song, S.W. (1999). A range minima parallel algorithm for coarse grained multicomputers. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097993
Download citation
DOI: https://doi.org/10.1007/BFb0097993
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive