Systolic s/sup 2/-Way Merge Sort is Optimal

Authors:
Hartmut Schmeck;Heiko Schröder;Christoph Starke
Affiliations:
Institut fu¨r Informatik und Praktische Mathematik der Univ. Kiel, Kiel, W. Germany;Institut fu¨r Informatik und Praktische Mathematik der Univ. Kiel, Kiel, W. Germany;Institut fu¨r Informatik und Praktische Mathematik der Univ. Kiel, Kiel, W. Germany
Venue:
IEEE Transactions on Computers
Year:
1989

Citing 4
Cited 0

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Lower bounds for sorting on mesh-connected architectures

Acta Informatica
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Sorting on a mesh-connected parallel computer

Communications of the ACM

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.