Optimal Gossip in Store-and-Forward Noncombining 2-D Tori

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 234-241

  Soch, Michal ^a   Tvrdik, Pavel ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

2 D torus; All to all broadcast; Gossip; Interconnection networks; Store and forward; Time arc disjoint broadcast trees

Indexed keywords

FORESTRY; INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

2-D TORUS; ALL-TO-ALL BROADCAST; BROADCAST TREE; GOSSIP; STORE AND FORWARD;

TREES (MATHEMATICS);

EID: 84882568531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002738     Document Type: Conference Paper

References (2)

1. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice Hall, 1989.
2. B. Plateau and D. Trystam. Optimal total exchange for a 3-D torus of processors. Information Processing Letters, 42: 95-102, 1992.