Systolic Sorting on a Mesh-Connected Network

DOI10.1109/TC.1985.1676603zbMath0566.68056OpenAlexW2036564095MaRDI QIDQ3681947

Heiko Schröder, Hartmut Schmeck, Hans-Werner Lang, Manfred Schimmler

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.1676603

zbMATH Keywords

parallel algorithmsystolic arrayVLSI implementationperfect shuffleVLSI algorithmsmesh-connected processor arrayVLSI complexitymerge algorithmodd- even-transposition sort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

A function for evaluating the computing time of a bubbling system ⋮ Space and time complexities of balanced sorting on processor arrays ⋮ Sorting in constant number of row and column phases on a mesh ⋮ Time lower bounds for parallel sorting on a mesh-connected processor array ⋮ VLSI-sorting evaluated under the linear model ⋮ Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ Indexing functions and time lower bounds for sorting on a mesh-connected computer ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ Processor-efficient sparse matrix-vector multiplication