Optimal algorithms for total exchange without buffering on the hypercube
From MaRDI portal
(Redirected from Publication:1195935)
Recommendations
Cites work
- Data communication in parallel architectures
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- Optimal algorithms for total exchange without buffering on the hypercube
- Total exchange algorithms on 'sandwich graphs'
Cited in
(13)- Total exchange algorithms on 'sandwich graphs'
- Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
- Optimal algorithms for total exchange without buffering on the hypercube
- Optimal data exchange algorithms on star graphs
- Methods and problems of communication in usual networks
- All-port total exchange in cartesian product networks
- On the theoretical properties of the exchange algorithm
- Exchanging messages of different sizes
- Communication algorithms in k-ary n-cube interconnection networks
- On Finite Dimension Exchange Algorithms
- Multiphase complete exchange: a theoretical analysis
- scientific article; zbMATH DE number 1760001 (Why is no real title available?)
- An Optimal Synchronizer for the Hypercube
This page was built for publication: Optimal algorithms for total exchange without buffering on the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195935)