A parallel sorting scheme whose basic operation sortsN elements
From MaRDI portal
Publication:3738572
DOI10.1007/BF00991185zbMath0602.68049OpenAlexW1982710023MaRDI QIDQ3738572
Shian-Shyong Tseng, Richard Chia-Tung 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
Related Items (1)
Cites Work
- A new parallel sorting algorithm based upon min-mid-max operations
- Diamond - A sorting method for vector machines
- A parallel merging algorithm
- Parallel complexity of sorting problems
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
- Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops)
- Finding the maximum, merging, and sorting in a parallel computation model
- An On-Chip Compare/Steer Bubble Sorter
- Parallel Sorting with Constant Time for Comparisons
- Parallel permutation and sorting algorithms and a new generalized connection network
- Merging with parallel processors
- Parallelism in Comparison Problems
- Improved Divide/Sort/Merge Sorting Networks
- Bounds to Complexities of Networks for Sorting and for Switching
- Lower Bounds on Merging Networks
- Sorting on a mesh-connected parallel computer
- Optimal Sorting Algorithms for Parallel Computers
- New Parallel-Sorting Schemes
- Algorithm and Hardware for a Merge Sort Using Multiple Processors
- Sorting on STAR
- Fast parallel sorting algorithms
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Simplified odd-even sort using multiple shift-register loops
- Parallel Processing with the Perfect Shuffle
This page was built for publication: A parallel sorting scheme whose basic operation sortsN elements
