Bitonic Sort on a Mesh-Connected Parallel Computer

DOI10.1109/TC.1979.1675216MaRDI QIDQ4170252zbMATH OpenFDO

Authors David Nassimi, Sartaj 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)

Cited in

(21)

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

This page was built for publication: Bitonic Sort on a Mesh-Connected Parallel Computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170252)