论文信息 - A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors

A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors

This paper presents an efficient parallel algorithm for sorting N data items on two-dimensional mesh connected-computers with multiple broadcasting (2-MCCMB). The algorithm uses N × N 2/3 processors and takes 0(N 1/3) time, whereas the previous algorithm by Chung-Horng Lung [3] uses N × N processors and takes 0(N l/2) time on 2-MCCMB.

C. Siva Ram Murthy | C. S. R. Krishnan

[1] Selim G. Akl,et al. Parallel Sorting Algorithms , 1985 .

[2] H. T. Kung,et al. Sorting on a mesh-connected parallel computer , 1977, CACM.

[3] Yoshihide Igarashi,et al. Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency , 1986, J. Parallel Distributed Comput..

[4] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[5] Chung-Horng Lung,et al. Parallel algorithms on a mesh with multiple broadcasting , 1990, Proceedings of the 1990 Symposium on Applied Computing.

[6] Donald E. Knuth,et al. Sorting and Searching , 1973 .