Abstract
We show that selection on an input of size N can be performed on a P-node hypercube (P=N/(log N)) in time O(N/P) with high probability, provided each node can process all the incident edges in one unit of time (this model is called the parallel model and has been assumed by previous researchers (e.g., [17])). This result is important in view of a lower bound of Plaxton that implies selection takes Ω((N/P) log log P + log P) time on a P-node hypercube if each node can process only one edge at a time (this model is referred to as the sequential model).
(Extended Abstract)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, Hopcroft, and Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
Ajtai, M., K'omlos, J., Steiger, W.L., and Szemeredi, E., ‘Deterministic Selection in O(log log n) Parallel Time,’ Proc. ACM Symposium on the Theory of Computing, 1986, pp. 188–195.
Cole, R., ‘An Optimally Efficient Selection Algorithm,’ Information Processing Letters 26, Jan. 1988, pp. 295–299.
Cole, R., and Yap, C., ‘A Parallel Median Algorithm,’ Information Processing Letters 20(3), 1985, pp. 137–139.
Floyd, R.W., and Rivest, R.L., ‘Expected Time Bounds for Selection,’ Communications of the ACM, vol. 18, no.3, 1975, pp. 165–172.
Leighton, T., Lecture Notes on Parallel Algorithms, MIT, 1988.
Meggido, ‘Parallel Algorithms for Finding the Maximum and the Median Almost Surely in Constant Time', Preliminary Report, CS Department, Carnegie-Mellon University, Pittsburg, PA, Oct. 1982.
Nassimi, D., and Sahni, S., ‘Data Broadcasting in SIMD Computers,’ IEEE Transactions on Computers, vol. c30, n02, 1981.
Palis, M., Rajasekaran, S., and Wei,D., ‘General Routing Algorithms for Star Graphs,’ Technical Report, Department of Computer and Information Science, Univ. of Pennsylvania, 1989.
Plaxton, C.G., ‘Load Balancing, Selection and Sorting on the Hypercube,’ Proc. First Annual ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 64–73.
Plaxton, C.G., ‘On the Network Complexity of Selection,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1989, pp. 396–401.
Rajasekaran, S., and Reif, J.H., ‘Derivation of Randomized Algorithms,’ Technical Report, Aiken Computing Lab., Harvard University, March 1987.
Rajasekaran, S., and Sen, S., ‘Random Sampling Techniques and Parallel Algorithms Design,’ to appear in Synthesis of Parallel Algorithms, Editor: Reif, J.H., 1990.
Ranade, A., ‘How to Emulate Shared Memory,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1987, pp. 185–194.
Reischuk, R., ‘Probabilistic Parallel Algorithms for Sorting and Selection,’ SIAM Journal of Computing, vol. 14, no. 2, 1985, pp. 396–409.
Upfal, E., ‘Efficient Schemes for Parallel Communication,’ Journal of the ACM, vol. 31, no. 3, July 1984, pp. 507–517.
Valiant, L.G., and Brebner, G.J., ‘Universal Schemes for Parallel Communication,’ Proc. ACM Symposium on Theory Of Computing, 1981, pp. 263–277.
Vishkin, U., ‘An Optimal Parallel Algorithm for Selection,’ Unpublished Manuscript, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasekaran, S. (1990). Randomized parallel selection. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_46
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive