Abstract
In this paper, a parallel algorithm to select the first k largest numbered processes in an n-cube network is proposed. The time complexity of the algorithm is max(O(k), O(n 2 )) and it is optimal when k≥n 2 . © 1990.
- Title
- Efficient parallel k selection algorithm
- Creators - without role
- Jang-Ping Sheu - Department of Electrical Engineering, National Central UniversityJyh-Shyan Tang - Tatung University
- Publication Details
- Information Processing Letters, Vol.35(6), pp.313-316
- Identifiers
- 9957771592506774
- Academic Unit
- Institute of Communications Engineering, College of Electrical Engineering and Computer Science, National Tsing Hua University
- Language
- English
- Resource Type
- Journal article