Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 273-282
- https://doi.org/10.1007/3-540-60249-6_59
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Periodic gossiping on treesDiscrete Applied Mathematics, 1994
- Traffic-light scheduling on the gridDiscrete Applied Mathematics, 1994
- Note on optimal gossiping in some weak-connected graphsTheoretical Computer Science, 1994
- PERPETUAL GOSSIPINGParallel Processing Letters, 1993
- Network communication in edge-colored graphs: gossipingIEEE Transactions on Parallel and Distributed Systems, 1993
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- Parallel algorithms for gossiping by mailInformation Processing Letters, 1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- On real-time cellular automata and trellis automataActa Informatica, 1984
- Systolic trellis automatata †International Journal of Computer Mathematics, 1984