Issue No. 07 - July (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.30857
The time complexity of Thompson and Kung's (1977) s/sup 2/-way merge sort is analyzed and shown to be asymptotically optimal with respect to the recently improved lower bound on sorting on a mesh-connected n*n array. New lower bounds for systolic sorting are derived. A systolic version of s/sup 2/-way merge sort is systematically constructed and shown to be asymptotically optimal as well.
time complexity; s/sup 2/-way merge sort; lower bound; systolic version; asymptotically optimal; parallel algorithms; sorting.
H. Schmeck, H. Schroder, C. Starke, "Systolic s/sup 2/-Way Merge Sort is Optimal", IEEE Transactions on Computers, vol. 38, no. , pp. 1052-1056, July 1989, doi:10.1109/12.30857