A new parallel sorting algorithm based upon min-mid-max operations
From MaRDI portal
Publication:795507
DOI10.1007/BF01937485zbMATH Open0542.68044OpenAlexW1971470553MaRDI QIDQ795507FDOQ795507
Authors: Shian-Shyong Tseng, R. C. T. Lee 
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01937485
Recommendations
Cites Work
- Title not available (Why is that?)
- Parallelism in Comparison Problems
- Finding the maximum, merging, and sorting in a parallel computation model
- Parallel Processing with the Perfect Shuffle
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Sorting on a mesh-connected parallel computer
- Parallel Sorting with Constant Time for Comparisons
- Parallel permutation and sorting algorithms and a new generalized connection network
- New Parallel-Sorting Schemes
- 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
- Optimal Sorting Algorithms for Parallel Computers
- An On-Chip Compare/Steer Bubble Sorter
- Lower Bounds on Merging Networks
- Bounds to Complexities of Networks for Sorting and for Switching
- Fast parallel sorting algorithms
- Diamond - A sorting method for vector machines
- A parallel merging algorithm
- Parallel complexity of sorting problems
- Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops)
- Merging with parallel processors
- Title not available (Why is that?)
- Simplified odd-even sort using multiple shift-register loops
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)
