Lower Bounds on Systolic Gossip

Gossiping is an information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In this paper we derive lower bounds on the gossiping time of systolic protocols, i.e. constituted by a periodic repetition of simple communication steps. In particular, if we denote by n the number of processors in the network, then for directed networks and for undirected networks in the half-duplex mode any s-systolic gossip protocol takes at least gslog2 n time steps, where g4 = 1:8133,

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Michele Flammini, Stephane Perennes
• Keywords: Distributed And Parallel Computing, Information Dissemination Process, IPPS 1997, S-systolic Gossip Protocol, Simple Communication Steps