Abstract
In this paper, algorithms are proposed for finding the first k largest numbered processes in hypercubes with and without faulty nodes. © 1989.
- Title
- Selection of the first k largest processes in hypercubes
- Creators - without role
- Jang-Ping Sheu - Department of Electrical Engineering, National Central UniversityChun-Lien Wu - Institute of Information Engineering, Tatung Institute of TechnologyGen-Huey Chen - National Taiwan University
- Identifiers
- 9957774033506774
- Academic Unit
- Institute of Communications Engineering, College of Electrical Engineering and Computer Science, National Tsing Hua University
- Language
- English
- Resource Type
- Journal article