scientific article; zbMATH DE number 3876584
zbMATH Open0549.68030MaRDI QIDQ3341891FDOQ3341891
Authors: Tom Leighton
Publication date: 1983
Title of this publication is not available (Why is that?)
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
minimum spanning treenetworksparallel computationdiscrete Fourier transformmatrix multiplicationsortingtransitive closurematrix-vector multiplicationinteger multiplicationorthogonal treesmeshes of trees
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Algorithms in computer science (68W99) Theory of operating systems (68N25)
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
- On the performance of parallel matrix factorisation on the hypermesh
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays
- Successive approximation in parallel graph algorithms (extended abstract)
- Successive approximation in parallel graph algorithms
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)