The Community for Technology Leaders
Green Image
<p>One of the fundamental algorithmic problems in computer science involves selecting thekth smallest element in a collection A of n elements. We propose an algorithm designmethodology to solve the selection problem on meshes with multiple broadcasting. Ourmethodology leads to a selection algorithm that runs in O(n/sup 1/8/(log n)/sup 3/4/))time on a mesh with multiple broadcasting of size n/sup 3/8/(log n)/sup 1/4//spltimes/n/sup 5/8//(log n)/sup 1/4/. This result is optimal over a large class of selectionalgorithms. Our result shows that just as for semigroup computations, selection can bedone faster on suitably chosen rectangular meshes than on square meshes.</p>
Index Termsmultiprocessor interconnection networks; query processing; parallel algorithms; fastselection algorithm; multiple broadcasting; meshes; rectangular meshes; queryprocessing; databases; algorithm design; parallel algorithms; optimal algorithms
S. Olariu, D. Bhagavathi, J.L. Schwing, J. Zhang, P.J. Looges, "A Fast Selection Algorithm for Meshes with Multiple Broadcasting", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 772-778, July 1994, doi:10.1109/71.296326
45 ms
(Ver 3.3 (11022016))