Fault-tolerant parallel k selection algorithm in n-cube networks

Jang-Ping Sheu

doi:10.1016/0020-0190(91)90161-A

Back

Fault-tolerant parallel k selection algorithm in n-cube networks

Journal article

Peer reviewed

Fault-tolerant parallel k selection algorithm in n-cube networks

Jang-Ping Sheu

Information Processing Letters, Vol.39(2), pp.93-97

31/07/1991

DOI: https://doi.org/10.1016/0020-0190(91)90161-A

Abstract

fault-tolerant

k selection

n-cube networks

Parallel algorithms

In this paper, a parallel algorithm to select the first k largest numbered processes in n-cube networks is proposed. The proposed algorithm can tolerate at most n - 1 faults. The time complexity of this algorithm is O(max(kn, n ² )). © 1991.

Metrics

1 Record Views

Details

Title: Fault-tolerant parallel k selection algorithm in n-cube networks
Creators - without role: Jang-Ping Sheu - Department of Electrical Engineering, National Central University
Publication Details: Information Processing Letters, Vol.39(2), pp.93-97
Identifiers: 9957776255706774
Academic Unit: Institute of Communications Engineering, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: English
Resource Type: Journal article

Fault-tolerant parallel k selection algorithm in n-cube networks

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media