Fault-tolerant parallel \(k\) selection algorithm in \(n\)-cube networks

DOI10.1016/0020-0190(91)90161-AzbMath0735.68007OpenAlexW2026061878MaRDI QIDQ1182125

Jang-Ping Sheu

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90161-a

zbMATH Keywords

fault-tolerantk selectionn-cube networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (1)

A RELIABLE SORTING ALGORITHM ON HYPERCUBE MULTICOMPUTERS

Cites Work

• Efficient parallel k selection algorithm
• Selection of the first k largest processes in hypercubes
• Unnamed Item

This page was built for publication: Fault-tolerant parallel \(k\) selection algorithm in \(n\)-cube networks