Parallel prefix computation on extended multi-mesh network.
From MaRDI portal
A parallel algorithm for prefix computation of \(N=n^{4}\) elements on an \(n\times n\) extended multi-mesh network is presented. The network is a modified version of an earlier multi-mesh network with a 4-regular structure. The algorithm takes \(O(N^{1/4})\) time on \(N\) processors (\(13N^{1/4}-5\) communication steps and \(\log N+4\) arithmetic/logic steps).
Recommendations
- Fast parallel algorithm for prefix computation in multi-mesh architecture
- Efficient parallel prefix algorithms on multiport message-passing systems
- scientific article; zbMATH DE number 3876584
- \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
- scientific article; zbMATH DE number 1185587
Cites work
- A new network topology with multiple meshes
- Depth-size trade-offs for parallel prefix computation
- Faster optimal parallel prefix sums and list ranking
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- Limited width parallel prefix circuits
- OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
- Parallel Prefix Computation
- Parallel Solution of Recurrence Problems
Cited in
(4)
This page was built for publication: Parallel prefix computation on extended multi-mesh network.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853159)