scientific article; zbMATH DE number 3876584
From MaRDI portal
Publication:3341891
Recommendations
- Efficient parallel computations on the reduced mesh of trees organization
- Solving tree problems on a mesh-connected processor array
- scientific article; zbMATH DE number 742956
- Parallel implementation of tree skeletons
- scientific article; zbMATH DE number 2100400
- Parallel algorithms for tree accumulations
- Computational Science – ICCS 2005
- Tree-based parallel algorithm design
- scientific article; zbMATH DE number 3843145
- Time-optimal tree computations on sparse meshes
Cited in
(11)- Parallel prefix computation on extended multi-mesh network.
- A theory of decomposition into prime factors of layered interconnection networks
- Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees
- A compact layout for the three-dimensional tree of meshes
- The balanced binary tree technique on mesh-connected computers
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- On the performance of parallel matrix factorisation on the hypermesh
- Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays
- Successive approximation in parallel graph algorithms
- Successive approximation in parallel graph algorithms (extended abstract)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341891)
