This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Systolic s/sup 2/-Way Merge Sort is Optimal
July 1989 (vol. 38 no. 7)
pp. 1052-1056
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.

[1] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS 1968 SJCC, vol. 32, Montvale, NJ: AFIPS Press, pp. 307- 314.
[2] M. J. Flynn, "Some computer organizations and their effectiveness,"IEEE Trans. Comput., vol. C-21, pp. 948-960, 1972.
[3] M. J. Foster and H. T. Kung, "The design of special purpose VLSI-chips,"IEEE Computer, vol. 13, pp. 26-40, 1980.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[5] M. Kumar and D. S. Hirschberg, "An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes,"IEEE Trans. Comput., vol. C-32, pp. 254-264, 1983.
[6] M. Kunde, "Lower bounds for sorting on mesh connected architectures,"Acta Inform., vol. 24, pp. 121-131, 1987.
[7] M. Kunde, H. -W. Lang, M. Schimmler, H. Schmeck, and H. Schröder, "The instruction systolic array and its relation to other models of parallel computers," inProc. Parallel Comput. '85, 1985.
[8] H. T. Kung, "Why systolic architectures?"IEEE Computer, vol. 15, pp. 37-46, 1982.
[9] H. T. Kung and C. E. Leiserson, "Systolic arrays (for VLSI)," inSparse Matrix Proceedings, I. S. Duff and G. W. Stewart, Eds. Soc. Industr. Appl. Math., pp. 256-282, 1978.
[10] H. -W. Lang, M. Schimmler, H. Schmeck, and H. Schröder, "Systolic sorting on a mesh-connected network,"IEEE Trans. Comput., vol. C-34, pp. 652-658, 1985.
[11] D. Nassimi and S. Sahni, "Bitonic sort on a mesh-connected parallel computer,"IEEE Trans. Comput., vol. C-28, pp. 2-7, 1979.
[12] K. Sado and Y. Igarashi, "A fast parallel sort on a mesh-connected processor array," Tech. Rep. Dep. Comput. Sci., Gunma University, Japan, 1985.
[13] K. Sado and Y. Igarashi, "A fast parallel pseudo-merge sort algorithm," Tech. Rep. Dep. Comput. Sci., Gunma University, Japan, 1985.
[14] C. P. Schnorr and A. Shamir, "An optimal sorting algorithm for mesh connected computers," inProc. 18th ACM Symp. Theory Comput., May 1986.
[15] C. Starke, "Systolisierung paralleler Sortierverfahren," Diplomarbeit, Institut f. Informatik, Universität Kiel, 1985.
[16] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, pp. 153-161, 1971.
[17] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263-271, 1972.

Index Terms:
time complexity; s/sup 2/-way merge sort; lower bound; systolic version; asymptotically optimal; parallel algorithms; sorting.
Citation:
H. Schmeck, H. Schroder, C. Starke, "Systolic s/sup 2/-Way Merge Sort is Optimal," IEEE Transactions on Computers, vol. 38, no. 7, pp. 1052-1056, July 1989, doi:10.1109/12.30857
Usage of this product signifies your acceptance of the Terms of Use.