Systolic Sorting on a Mesh-Connected Network

Authors:
H. -W. Lang;M. Schimmler;H. Schmeck;H. Schroder
Affiliations:
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1985

Citing 0
Cited 3

Processor-efficient sparse matrix-vector multiplication

Computers & Mathematics with Applications
Paper: Parallel strong orientation on a mesh connected computer

Parallel Computing
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	14.98

Visualization

Abstract

A parallel algorithm for sorting n data items in O(n) steps is presented. Its simple structure and the fact that it needs local communication only make it suitable for an implementation in VLSI technology. The algorithm is based on a merge algorithm that merges four subfiles stored in a mesh-connected processor array. This merge algorithm is composed of the perfect shuffle and odd-even-transposition sort. For the VLSI implementation a systolic version of the algorithm is presented. The area and time complexities for a bit-serial and a bit-parallel version of this implementation are analyzed.