Title :
Selection on the reconfigurable mesh
Author :
Hao, E. ; Mackenzie, P.D. ; Stout, Quentin F.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI
Abstract :
A Θ(log n) time algorithm to select the kth smallest element in a set of n elements on a reconfigurable mesh with n processors is obtained. This improves on the previous fastest algorithm´s running time by a factor of log n. It is also shown that variants of this problem can be solved even faster. Finally, a proof of Ω(log log n) lower bound time for the rmesh selection problem is given
Keywords :
parallel algorithms; reconfigurable architectures; kth smallest element; lower bound time; parallel algorithms; reconfigurable mesh;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location :
McLean, VA
Print_ISBN :
0-8186-2772-7
DOI :
10.1109/FMPC.1992.234907
