Optimal Sorting Algorithms for Parallel Computers

DOI10.1109/TC.1978.1674957MaRDI QIDQ4146248zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(20)

• A parallel sorting scheme whose basic operation sortsN elements
• Systolic processing for dynamic programming problems
• A time-space optimal parallel sorting on a hypercube
• Diameter bounds and recursive properties of Full-Flag Johnson graphs
• A Kogbetliantz-type algorithm for the hyperbolic SVD
• A complexity theory of efficient parallel algorithms
• On mapping processes to processors in distributed systems
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
• A note on the token distribution problem
• The parallel odd-even merge algorithm
• Implementing shared memory on multi-dimensional meshes and on the fat-tree
• Parallel merging sorting using comparison matrices. I
• Efficient algorithms for parallel sorting on mesh multicomputers
• A new parallel sorting algorithm based upon min-mid-max operations
• Representing shared data on distributed-memory parallel computers
• k-fold bitonic sort on a mesh-connected parallel computer
• A parallel merging algorithm
• A VLSI algorithm for sorting variable-length character strings
• The complexity of deterministic PRAM simulation on distributed memory machines

This page was built for publication: Optimal Sorting Algorithms for Parallel Computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146248)