The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
ISBN: 0-8186-7038-X
pp: 280
S. Ramnath , Dept. of Comput. Sci., St. Cloud State Univ., MN, USA
ABSTRACT
Efficient scalable algorithms are developed for a mesh with fixed buses. The problems considered are merging, sorting and selection. The size of the input is fixed at n, and the mesh size is varied from /spl radic/n/spl times//spl radic/n to n/spl times/n. The merging algorithm is optimal for all the mesh sizes, whereas the sorting and selection algorithms are within factors of i/(1-/spl epsiv/) and log/sup 4/3/ n respectively, of the optimal.
INDEX TERMS
parallel machines; parallel algorithms; merging; sorting; scalable mesh algorithms; merging; sorting; mesh connected computers; field buses; merging algorithm; selection algorithms
CITATION
S. Ramnath, "Efficient scalable mesh algorithms for merging, sorting and selection", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 280, 1995, doi:10.1109/AISPAS.1995.401328
95 ms
(Ver 3.3 (11022016))