Fast parallel algorithm for prefix computation in multi-mesh architecture

DOI10.1142/S0129626417500098MaRDI QIDQ5087835zbMATH OpenOpenAlexFDO

Authors Amit Datta, Mallika de, Bhabani P. Sinha

Publication date 4 July 2022

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626417500098

zbMATH Keywords

parallel algorithmscomputation timeprefix computationdata communication timeMulti Mesh networkstatic interconnection networks

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Parallel prefix computation on extended multi-mesh network.
• Efficient parallel prefix algorithms on multiport message-passing systems
• \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
• scientific article; zbMATH DE number 1307000
• An Improved Parallel Prefix Sums Algorithm

Cites work

• A new network topology with multiple meshes
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
• Distributed Computing - IWDC 2004
• OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
• Parallel prefix computation on extended multi-mesh network.

Cited in

(2)

• Parallel prefix computation on extended multi-mesh network.
• Scaling multiple addition and prefix sums on the reconfigurable mesh.

This page was built for publication: Fast parallel algorithm for prefix computation in multi-mesh architecture

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