The connection machine
The telephone problem for trees
Journal of Information Processing and Cybernetics
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for gossiping by mail
Information Processing Letters
Optimum algorithms for dissemination of information in some interconnection networks
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
SIAM Journal on Computing
Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Lower Bounds on Systolic Gossip
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
-Systolic Broadcasting in a Wrapped Butterfly Network
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Lower bounds on systolic gossip
Information and Computation
Lower bounds on systolic gossip
Information and Computation
| Hi-index | 0.00 |
A mechanism for scheduling communications in a network in which individuals exchange information periodically according to a fixed schedule is presented. A proper kedge-coloring of the network is considered to be a schedule of allowed communicationssuch that an edge of color i can be used only at times i modulo k. Within thiscommunication scheduling mechanism, the information exchange problem known asgossiping is considered. It is proved that there is a proper k edge-coloring such thatgossip can be completed in a path of n edges in a certain time for ngreater than or equal to k greater than or equal to 1. Gossipcan not be completed in such a path any earlier under any proper k edge-coloring. In anytree of bounded degree Delta and diameter d, gossip can be completed under a properDelta edge-coloring in time ( Delta -1)d+1. In a k edge-colored cycle of n vertices, othertime requirements of gossip are determined.