A new parallel sorting algorithm based upon min-mid-max operations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3607946 (Why is no real title available?)
- 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
- 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 a mesh-connected parallel computer
Cited in
(4)
This page was built for publication: A new parallel sorting algorithm based upon min-mid-max operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795507)
