Short communicationHyper-ring connection machines
References (16)
- et al.
On disseminating information reliably without broadcasting
- et al.
Efficiency of semi-synchronous versus asynchronous networks
Center for Research in Computing Technology, Harvard University, TR-21-90
(1990) Complexity of network synchronization
J. ACM
(1985)- et al.
Implementation issues in clock synchronization
- et al.
A modular proof of correctness for a network synchronizer
- et al.
An optimal scheme for disseminating information
- et al.
Fault-tolerant broadcasting in binary jumping networks
- et al.
Optimal schemes for disseminating information and their fault tolerance
IEICE Trans. Inf. and Syst.
(1992)
There are more references available in the full text version of this article.
Cited by (4)
Independent spanning trees of chordal rings
1999, Information Processing LettersPredicting Speedup for Distributed Computing on a Token Ring Network
1997, Journal of Parallel and Distributed ComputingFast and dependable communication in hyper-rings
2002, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Independent spanning trees of chordal rings
1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1995 Published by Elsevier B.V.