A parallel sorting scheme whose basic operation sortsN elements

DOI10.1007/BF00991185MaRDI QIDQ3738572zbMATH OpenOpenAlexFDO

Authors Shian-Shyong Tseng, R. C. T. Lee

Publication date 1985

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00991185

zbMATH Keywords

odd-even merge\(n\)-sorter

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A new parallel sorting algorithm based upon min-mid-max operations
• scientific article; zbMATH DE number 4070343
• Sorting in Parallel
• Cubesort: A parallel algorithm for sorting N data items with S-sorters
• Parallel sorting revisited

Cites work

• A new parallel sorting algorithm based upon min-mid-max operations
• A parallel merging algorithm
• Algorithm and Hardware for a Merge Sort Using Multiple Processors
• An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
• An On-Chip Compare/Steer Bubble Sorter
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Bounds to Complexities of Networks for Sorting and for Switching
• Diamond - A sorting method for vector machines
• Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops)
• Fast parallel sorting algorithms
• Finding the maximum, merging, and sorting in a parallel computation model
• Improved Divide/Sort/Merge Sorting Networks
• Lower Bounds on Merging Networks
• Merging with parallel processors
• New Parallel-Sorting Schemes
• Optimal Sorting Algorithms for Parallel Computers
• Parallel Processing with the Perfect Shuffle
• Parallel Sorting with Constant Time for Comparisons
• Parallel complexity of sorting problems
• Parallel permutation and sorting algorithms and a new generalized connection network
• Parallelism in Comparison Problems
• Simplified odd-even sort using multiple shift-register loops
• Sorting on STAR
• Sorting on a mesh-connected parallel computer

Cited in

(3)

• Constructing sorting networks from k-sorters
• A new parallel sorting algorithm based upon min-mid-max operations
• Towards simpler sorting networks and monotone circuits for majority

This page was built for publication: A parallel sorting scheme whose basic operation sortsN elements

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