Parallel Sorting with Limited Bandwidth

DOI10.1137/S0097539797315884MaRDI QIDQ4507334zbMATH OpenFDO

Authors John W. Byers, Micah Adler, Richard Karp

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539797315884

zbMATH Keywords

BSPlimited bandwidthLogPparallel sortingPRAM

Mathematics Subject Classification ID

Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1256741
• Communication-Efficient Parallel Sorting
• The Complexity of Parallel Sorting
• Tight Bounds on the Complexity of Parallel Sorting
• Routing, merging, and sorting on parallel models of computation

Cited in

(5)

• Routing, merging, and sorting on parallel models of computation
• Parallel Sorting with Serial Memories
• The Complexity of Parallel Sorting
• Communication-Efficient Parallel Sorting
• Trade-offs between communication throughput and parallel time

This page was built for publication: Parallel Sorting with Limited Bandwidth

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