A note on optimal time broadcast in faulty hypercubes
From MaRDI portal
Publication:1892869
DOI10.1006/JPDC.1995.1054zbMATH Open0826.68015OpenAlexW2010237806MaRDI QIDQ1892869FDOQ1892869
Authors: David Peleg 
Publication date: 6 July 1995
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1995.1054
Recommendations
- On optimal broadcasting in faulty hypercubes
- Optimal broadcasting in hypercubes with dynamic faults
- Tighter time bounds on fault-tolerant broadcasting and gossiping
- Broadcasting in hypercubes with randomly distributed Byzantine faults
- scientific article; zbMATH DE number 1138357
- scientific article; zbMATH DE number 1420908
- Broadcasting in hypercubes and star graphs with dynamic faults.
- Reliable broadcasting in hypercubes with random link and node failures
- Fault—tolerant hypercube broadcasting via information dispersal
- Time bounds on fault‐tolerant broadcasting
Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)
Cited In (11)
- Global commutative and associative reduction operations in faulty SIMD hypercubes
- Optimal time broadcasting in faulty star networks
- Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
- Communication complexity of fault-tolerant information diffusion
- On optimal broadcasting in faulty hypercubes
- Title not available (Why is that?)
- Optimal broadcasting in hypercubes with dynamic faults
- Broadcasting in hypercubes and star graphs with dynamic faults.
- Minimum time broadcast in faulty star networks
- Deterministic Models of Communication Faults
- Title not available (Why is that?)
This page was built for publication: A note on optimal time broadcast in faulty hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892869)
