Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers

DOI10.1080/00207160304673MaRDI QIDQ4805931zbMATH OpenOpenAlexFDO

Authors Hong Shen, Yijie Han, Yi Pan, D. J. Evans

Publication date 8 May 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160304673

zbMATH Keywords

multiselectionmesh-connected computers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1444292
• Selection on k-Dimensional Meshes with Multiple Broadcasting
• Fast deterministic selection on mesh-connected processor arrays
• An optimal parallel algorithm for the multiselection problem
• Optimal parallel multiselection on EREW PRAM

Cites work

• scientific article; zbMATH DE number 4155881 (Why is no real title available?)
• scientific article; zbMATH DE number 1444292 (Why is no real title available?)
• A Unified Lower Bound for Selection and Set Partitioning Problems
• A parallel median algorithm
• An optimally efficient selection algorithm
• Finding the median
• Improved universal \(k\)-selection in hypercubes
• New upper bounds for selection
• Parallel Processing with the Perfect Shuffle
• Refined complexity analysis for heap operations
• Time bounds for selection

Cited in

(5)

• scientific article; zbMATH DE number 4092792 (Why is no real title available?)
• On computing an optimal permutation of ranks for multiselection
• Efficient processor allocation strategies for mesh-connected parallel computers
• An efficient parallel algorithm for multiselection
• scientific article; zbMATH DE number 3843148 (Why is no real title available?)

This page was built for publication: Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers

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