Communication-Efficient Parallel Sorting

DOI10.1137/S0097539795294141MaRDI QIDQ4268890zbMATH OpenFDO

Authors Michael T. Goodrich

Publication date 28 October 1999

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

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

zbMATH Keywords

parallel algorithmsparallel processingparallel sorting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1256741
• Parallel Sorting with Limited Bandwidth
• Tight Bounds on the Complexity of Parallel Sorting
• Sorting in rounds
• Communication primitives for BSP computers

Cited in

(12)

• Massively parallel entity matching with linear classification in low dimensional space
• Irredundant intervals
• Constant time parallel sorting: An empirical view.
• Parallel Sorting with Limited Bandwidth
• Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
• Equivalence classes and conditional hardness in massively parallel computations
• scientific article; zbMATH DE number 1256741 (Why is no real title available?)
• An architecture independent study of parallel segment trees
• A randomized sorting algorithm on the BSP model
• Communication-space efficient parallel bitonic sorting on symmetric multiprocessors
• Trade-offs between communication throughput and parallel time
• scientific article; zbMATH DE number 7566062 (Why is no real title available?)

This page was built for publication: Communication-Efficient Parallel Sorting

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