Gossiping large packets on full-port tori

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

Volumn 1470 LNCS, Issue , 1998, Pages 1040-1046

  Meyer, Ulrich ^a   Sibeyn, Jop F ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

HIGHER-DIMENSIONAL; NEAR-OPTIMAL; OPTIMALITY; STARTUP TIME; TIME-DEPENDENT ROUTING;

ARTIFICIAL INTELLIGENCE;

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

References (5)

1. Alspach, B., J-C. Bermond, D. Sotteau, 'Decomposition into Cycles h Hamilton Decompositions,' Proc. Workshop Cycles and Rays, Montreal, 1990.
2. Aubert, J., B. Schneider, 'Decomposition de la Somme Cartesienne d'un Cycle et de l'Union de Deux Cycles Hamiltoniens en Cycles Hamiltonien,' Discrete Mathematics, 38, pp. 7-16, 1982.
3. Foregger, M.F., 'Hamiltonian Decomposition of Products of Cycles,' Discrete Mathematics, 24, pp. 251-260, 1978.
4. Meyer, U., J. F. Sibeyn, 'Time-Independent Gossiping on Full-Port Tori,' Techn. Rep. MPI-98-1-014, Max-Planck Inst. für Informatik, Saarbrücken, Germany, 1998.
5. Soch, M., P. Tvrdfk, 'Optimal Gossip in Store-and-Forward Noncombining 2-D Tori,' Proc. 3rd International Euro-Par Conference, LNCS 1300, pp. 234-241, Springer-Verlag, 1997.