Efficient parallel k selection algorithm

DOI10.1016/0020-0190(90)90034-UMaRDI QIDQ912623zbMATH OpenOpenAlexFDO

Authors 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

k skeletonn-cube networkparallel algorithm

Mathematics Subject Classification ID

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

Recommendations

• Fault-tolerant parallel k selection algorithm in n-cube networks
• Improved universal \(k\)-selection in hypercubes
• scientific article; zbMATH DE number 278835
• Sorting-based selection algorithms for hypercubic networks
• A parallel selection algorithm

Cites work

• 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
• Decentralized extrema-finding in circular configurations of processors
• Parallel Merge Sort
• Selection of the first k largest processes in hypercubes

Cited in

(8)

• A parallel algorithm for finding the maximum value
• An efficient parallel algorithm for multiselection
• Fault-tolerant parallel k selection algorithm in n-cube networks
• Improved universal \(k\)-selection in hypercubes
• Optimal parallel construction of heaps
• scientific article; zbMATH DE number 278835 (Why is no real title available?)
• Fast <it>k</it>-selection algorithms for graphics processing units
• An efficient selection algorithm on the pyramid

This page was built for publication: Efficient parallel k selection algorithm

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