Abstract
We consider the problem of computing the minimum of n values, and several well-known generalizations (prefix minima, range minima, and all-nearest-smaller-values (ANSV) problems) for input elements drawn from the integer domain [1., s] where s≥n. Recent work [4] has shown that parallel algorithms that are sensitive to the size of the input domain can improve on more general parallel algorithms. The cited paper demonstrates an O(log log log s)-step algorithm on an n-processor
Priority CRCW PRAM for finding the prefix-minima of n numbers in the range [1., s]. The best known upper bounds for the range minima and ANSV problems were previously O(log log n) (using algorithms for general input). This was also the best known upper bound for computing prefix minima or even just the minimum on the common CRCW PRAM; this model has a Θ(log n/ log log n) time separation from the stronger Priority model when using the same number of processors. In this paper we give simple and efficient algorithms for all of the above problems. These algorithms all take O(log log log s) time using an optimal number of processors and O(ns)∈ space on the Common CRCW PRAM. We also prove a lower bound demonstrating that no algorithm is asymptotically faster as a function of s, by showing that for \(s = 2^{2^{\Omega (log n log log n)} }\) the upper bounds are tight.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Amir, G. M. Landau, and U. Vishkin. Efficient pattern matching with scaling. In Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344–357, 1990.
P. Beame and J. Håstad. Optimal bounds for decision problems on the CRCW PRAM. In Proc. of the 19th Ann. ACM Symp. on Theory of Computing, pages 83–93, 1987.
C. Berge. Graphs and Hypergraphs. North-Holland, 1973.
O. Berkman, J. JáJá, S. Krishnamurthy, R. Thurimella, and U. Vishkin. Some triply-logarithmic parallel algorithms. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, pages 871–881, 1990. To appear in SIAM J. of Comput. as ‘Top-bottom routing around a rectangle is as easy as computing prefix minima'.
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. On parallel integer merging. Technical Report UMIACS-TR-90-15.1 (revised version), Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742, USA, 1990. To appear in Information and Computation.
R. B. Boppana. Optimal separations between concurrent-write parallel machines. In Proc. of the 21st Ann. ACM Symp. on Theory of Computing, pages 320–326, 1989.
S. Chaudhuri. Lower Bounds for Parallel Computation. PhD thesis, Rutgers University, 1991.
J. Edmonds. Lower bounds with smaller domain size on concurrent write parallel machines. In Proc. 6th Annual IEEE Conference on Structure in Complexity Theory, 1991.
P. Erdős and R. Rado. Intersection theorems for systems of sets. J. London Math. Soc., 35:85–90, 1960.
F. E. Fich, F. Meyer auf der Heide, and A. Wigderson. Lower bounds for parallel random-access machines with unbounded shared memory. In Advances in Computing Research. JAI Press, 1986.
F. E. Fich, P. L. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation (preliminary version). In Proceedings 3rd Annual ACM Symposium on Principles of Distributed Computing, pages 179–189, 1984.
F. E. Fich, P. L. Ragde, and A. Wigderson. Simulations among concurrent-write PRAMs. Algorithmica, 3:43–51, 1988.
H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. of the 16th Ann. ACM Symp. on Theory of Computing, pages 135–143, 1984.
M. T. Goodrich. Triangulating a polygon in parallel. Journal of Algorithms, 10:327–351, 1989.
V. Grolmusz and P. L. Ragde. Incomparability in parallel computation. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 89–98, 1987.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2):338–355, 1984.
C. P. Kruskal. Searching, merging, and sorting in parallel computation. IEEE Trans. on Comp, C-32:942–946, 1983.
F. Meyer auf der Heide and A. Wigderson. The complexity of parallel sorting. In Proc. of the 26th IEEE Annual Symp. on Foundation of Computer Science, pages 532–540, 1985.
P. L. Ragde, W. L. Steiger, E. Szemerédi, and A. Wigderson. The parallel complexity of element distinctness is Ω(√log n). SIAM Journal on Disceret Mathematics, 1(3):399–410, Aug. 1988.
V. Ramachandran and U. Vishkin. Efficient parallel triconnectivity in logarithmic parallel time. In Proc. of the 3rd Aegean Workshop on Parallel Computing, Springer LNCS 319, pages 33–42, 1988.
B. Schieber. Design and analysis of some parallel algorithms. PhD thesis, Dept. of Computer Science, Tel Aviv Univ., 1987.
B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput., 17(6):1253–1262, 1988.
Y. Shiloach and U. Vishkin. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms, 2:88–102, 1981.
M. Snir. On parallel searching. SIAM J. Comput., 14:688–707, 1985.
L. G. Valiant. Parallelism in comparison problems. SIAM J. Comput., 4:348–355, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berkman, O., Matias, Y., Ragde, P. (1993). Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_246
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_246
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive