Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes

DOI10.1016/J.JPDC.2004.05.004zbMATH Open1140.68544OpenAlexW380496871MaRDI QIDQ852884FDOQ852884

Authors: Yu-Wei Chen 

Publication date: 15 November 2006

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.05.004

Recommendations

• Dimension ordering and broadcast algorithms in faulty SIMD hypercubes
• scientific article; zbMATH DE number 1138357
• A note on optimal time broadcast in faulty hypercubes
• Optimal broadcasting in hypercubes with dynamic faults
• On optimal broadcasting in faulty hypercubes

zbMATH Keywords

parallel algorithmfault tolerancelight-occupied dimensionone-to-all broadcastingSIMD hypercube

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Cited In (2)

• Global commutative and associative reduction operations in faulty SIMD hypercubes
• Improved fault-tolerance sorting algorithm in hypercubes

This page was built for publication: Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes

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