Selection of the first k largest processes in hypercubes
Resource
Parallel Computing 11 (3): 381-384
Journal
Parallel Computing
Journal Volume
11
Journal Issue
3
Pages
381-384
Date Issued
1989
Date
1989
Author(s)
Abstract
In this paper, algorithms are proposed for finding the first k largest numbered processes in hypercubes with and without faulty nodes. © 1989.
Subjects
Election problem; hypercubes; k-selection problem
Other Subjects
Computer Systems, Digital--Parallel Processing; Election Problem; Hypercubes; K Selection Problem; Parallel Algorithms; Computer Programming
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
05.pdf
Size
201.77 KB
Format
Adobe PDF
Checksum
(MD5):5b1f1173571b72acd9275c2e47f1d537