An adaptive global reduction algorithm for wormhole-routed 2D meshes

DOI10.1016/S0167-8191(97)00097-5MaRDI QIDQ1127439zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 13 August 1998

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(97)00097-5

zbMATH Keywords

2D meshcollective communicationglobal reductionwormhole routing

Mathematics Subject Classification ID

Computer system organization (68M99) Parallel algorithms in computer science (68W10)

Recommendations

• \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
• Optimal fully adaptive minimal wormhole routing for meshes
• Practical algorithms for online routing on fixed and reconfigurable meshes

Cited in

(2)

• \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
• Optimal fully adaptive minimal wormhole routing for meshes

This page was built for publication: An adaptive global reduction algorithm for wormhole-routed 2D meshes

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