Efficient parallel k selection algorithm

DOI10.1016/0020-0190(90)90034-UzbMath0698.68049OpenAlexW2002711371MaRDI QIDQ912623

Jyhshyan Tang, Jang-Ping Sheu

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90034-u

zbMATH Keywords

parallel algorithmk skeletonn-cube network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

Related Items

Fault-tolerant parallel \(k\) selection algorithm in \(n\)-cube networks, Optimal parallel construction of heaps

Cites Work

• Selection of the first k largest processes in hypercubes
• Parallel Merge Sort
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle