Abstract
One of the fundamental algorithmic problems in computer science involves selecting thekth smallest element in a setS ofn elements. In this paper we present a fast selection algorithm which runs inO(n 1/8 logn) time on a mesh with multiple broadcasting of sizen 3/8 ×n 5/8. Our result shows that, just like semigroup computations, selection can be done much faster on a suitably chosen rectangular mesh than on square meshes. We also show that if every processor can storen 1/9 items, then our selection algorithm runs inO(n 1/9 logn) time on a mesh with multiple broadcasting of sizen 1/3 ×n 5/9.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Aggarwal,Optimal bounds for finding maximum on array of processors with k global buses, IEEE Trans. on Computers, C-35, 1986, 62–64.
A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
A. Bar-Noy and D. Peleg,Square meshes are not always optimal, IEEE Trans. on Computers, C-40, 1991, 196–204.
W.-E. Blanz, D. Petkovic and J. L. C. Sanz,Algorithms and Architectures for Machine Vision, in C. H. Chen, ed.,Signal Processing Handbook, M. Dekker, New York, 1989.
S. H. Bokhari,Finding maximum on an array processor with a global bus, IEEE Trans. Comput. vol. C-33, no. 2, Feb. 1984, pp. 133–139.
Y. C. Chen, W. T. Chen, G. H. Chen and J. P. Sheu,Designing efficient parallel algorithms on mesh connected computers with multiple broadcasting, IEEE Trans. Parallel and Dist. Sys., vol. 1, no. 2, Apr. 1990.
F. Thomson Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, San Mateo, California, 1992.
M. Maresca and H. Li,Connection autonomy and SIMD computers: a VLSI implementation, Journal of Parallel and Distributed Computing, vol. 7 (1989) pp. 302–320.
D. Nassimi and S. Sahni,Data broadcasting in SIMD computers, IEEE Trans. Comput. vol. C-30, Feb. 1981, pp. 101–107.
D. Nassimi and S. Sahni,Bitonic sort on a mesh-connected parallel computer, IEEE Trans. Comput. vol. C-27, Jan. 1979.
D. Parkinson, D. J. Hunt and K. S. MacQueen,The AMT DAP 500, 33rd IEEE Comp. Soc. International Conf., Feb. 1988, pp. 196–199.
V. P. Kumar and C. S. Raghavendra,Array processor with multiple broadcasting, J. Distribut. Comput., vol. 2, 1987, pp. 173–190.
V. P. Kumar and D. I. Reisis,Image computations on meshes with multiple broadcast, IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, 1989, pp. 1194–1201.
Q. Stout,Meshes with multiple buses, in Proc. 27th IEEE Symp. Found. Comput. Sci., 1986, pp. 264–273.
D. Tabak,Multiprocessors, Prentice-Hall, Englewood Cliffs, New Jersey, 1990.
Author information
Authors and Affiliations
Additional information
Work supported by NASA under grant NCC1-99.
This author was partly supported by NSF grant CCR-8009996.
Rights and permissions
About this article
Cite this article
Bhagavathi, D., Looges, P.J., Olariu, S. et al. Selection on rectangular meshes with multiple broadcasting. BIT 33, 7–14 (1993). https://doi.org/10.1007/BF01990339
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01990339