Fast parallel sorting algorithms
From MaRDI portal
Publication:4162670
DOI10.1145/359576.359582zbMath0383.68051OpenAlexW2046565312MaRDI QIDQ4162670
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359576.359582
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)
Related Items
A VLSI algorithm for sorting variable-length character strings ⋮ An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs ⋮ Towards optimal parallel bucket sorting ⋮ A unified \(O(\log N)\) and optimal sorting vector algorithm ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ Parallel algorithms for a depth first search and a breadth first search ⋮ Parallel search algorithms for graphs and trees ⋮ Parallelization alternatives and their performance for the convex hull problem ⋮ Parallel iterated bucket sort ⋮ Deterministic P-RAM simulation with constant redundancy ⋮ A parallel algorithm for generating combinations ⋮ A general class of resource tradeoffs ⋮ Linear sorting with O(log n) processors ⋮ A new parallel sorting algorithm based upon min-mid-max operations ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ A parallel selection algorithm ⋮ An adaptive and cost-optimal parallel algorithm for minimum spanning trees
