Title :
Systolic s2-way merge sort is optimal
Author :
Schmeck, Hartmut ; Schröder, Heiko ; Starke, Christoph
Author_Institution :
Inst. fur Inf. & Praktische Math., Kiel Univ., West Germany
fDate :
7/1/1989 12:00:00 AM
Abstract :
The time complexity of Thompson and Kung´s (1977) s2 -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 s2 -way merge sort is systematically constructed and shown to be asymptotically optimal as well
Keywords :
parallel algorithms; sorting; asymptotically optimal; lower bound; s2-way merge sort; systolic version; time complexity; Arithmetic; Art; Computational modeling; Libraries; Programming; Registers; Sorting;
Journal_Title :
Computers, IEEE Transactions on
