Routing, merging, and sorting on parallel models of computation
- 1 February 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 30 (1) , 130-145
- https://doi.org/10.1016/0022-0000(85)90008-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Parallel Sorting with Constant Time for ComparisonsSIAM Journal on Computing, 1981
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1976
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971