Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
Author:
- Pierre FraigniaudPFPierre Fraigniaud
- 1 September 1992
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 16 (1) , 15-26
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Finding the roots of a polynomial on an MIMD multicomputerParallel Computing, 1990
- Scattering on a ring of processorsParallel Computing, 1990
- Graph theoretic characterization and reliability of the generalized Boolean n-cube networkParallel Computing, 1989
- Performance of fault-tolerant diagnostics in the hypercube systemsIEEE Transactions on Computers, 1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Comparing shared and distributed memory computersParallel Computing, 1988
- Recursive Mesh Refinement on Hypercubes1988
- On embedding rectangular grids in hypercubesIEEE Transactions on Computers, 1988
- Strategies for interconnection networks: Some methods from graph theoryJournal of Parallel and Distributed Computing, 1986
- The architecture of a homogeneous vector supercomputersJournal of Parallel and Distributed Computing, 1986