Bitonic Sort on a Mesh-Connected Parallel Computer

DOI10.1109/TC.1979.1675216zbMath0388.68058MaRDI QIDQ4170252

David Nassimi, Sartaj K. Sahni

Publication date: 1979

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items

A VLSI algorithm for sorting variable-length character strings ⋮ Selection on rectangular meshes with multiple broadcasting ⋮ Space and time complexities of balanced sorting on processor arrays ⋮ Sorting in constant number of row and column phases on a mesh ⋮ HISTOGRAMMING ON A RECONFIGURABLE MESH COMPUTER∗ ⋮ SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ Time lower bounds for parallel sorting on a mesh-connected processor array ⋮ Noisy sort, a memory-intensive sorting algorithm ⋮ VLSI-sorting evaluated under the linear model ⋮ A constant-time parallel algorithm for computing convex hulls ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ An efficient selection algorithm on the pyramid ⋮ Indexing functions and time lower bounds for sorting on a mesh-connected computer ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ Simulating the Bitonic Sort Using P Systems ⋮ A unified algorithm for sorting on multidimensional mesh-connected processors ⋮ A generalization of the zero-one principle for sorting algorithms ⋮ Parallel geometric algorithms on a mesh-connected computer ⋮ A new parallel sorting algorithm based upon min-mid-max operations ⋮ k-fold bitonic sort on a mesh-connected parallel computer