Optimal Sorting Algorithms for Parallel Computers
From MaRDI portal
Publication:4146248
DOI10.1109/TC.1978.1674957zbMath0369.68021OpenAlexW1808157072MaRDI QIDQ4146248
Gerard M. Baudet, David J. Stevenson
Publication date: 1978
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1978.1674957
Related Items (20)
A VLSI algorithm for sorting variable-length character strings ⋮ A Kogbetliantz-type algorithm for the hyperbolic SVD ⋮ On mapping processes to processors in distributed systems ⋮ Systolic processing for dynamic programming problems ⋮ Parallel merging sorting using comparison matrices. I ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ Implementing shared memory on multi-dimensional meshes and on the fat-tree ⋮ Representing shared data on distributed-memory parallel computers ⋮ A parallel merging algorithm ⋮ A complexity theory of efficient parallel algorithms ⋮ The parallel odd-even merge algorithm ⋮ Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays ⋮ A note on the token distribution problem ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy ⋮ A new parallel sorting algorithm based upon min-mid-max operations ⋮ A time-space optimal parallel sorting on a hypercube ⋮ k-fold bitonic sort on a mesh-connected parallel computer
This page was built for publication: Optimal Sorting Algorithms for Parallel Computers
