Improved fault-tolerance sorting algorithm in hypercubes

DOI10.1016/S0304-3975(00)00390-XMaRDI QIDQ5941735zbMATH OpenFDO

Authors Kuo-Liang Chung, Yu-Wei Chen

Publication date 23 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00390-X

zbMATH Keywords

hypercubeparallel sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
• A generalized fault-tolerant sorting algorithm on product network
• A generalized fault-tolerant sorting algorithm on product network
• Dimension ordering and broadcast algorithms in faulty SIMD hypercubes
• Fault-tolerant routing in hypercubes using probability vectors

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 922888 (Why is no real title available?)
• Improved sorting networks with O(log N) depth
• Optimal parallel algorithms for computing convex hulls and for sorting
• Pipelined parallel prefix computations, and sorting on a pipelined hypercube

Cited in

(1)

• A generalized fault-tolerant sorting algorithm on product network

This page was built for publication: Improved fault-tolerance sorting algorithm in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941735)