Dissemination of information in vertex-disjoint paths mode

Computers and Artificial Intelligence

Volumn 15, Issue 4, 1996, Pages 295-318

  Hromkovič, Juraj ^a   Klasing, Ralf ^a   Stöhr, Elena A ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749099766     PISSN: 02320274     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. AIELLO, W. A. - LEIGHTON, F. T. - MAGGS, B. M. - NEWMAN, M.: Fast algorithms for bit-serial routing on a hypercube. Mathematical Systems Theory, Vol. 24, 1991, No. 4, pp. 253-271.
2. BEN-ASHER, Y. - PELEG, D. - RAMASWAMI, R. - SCHUSTER, A.: The power of reconfiguration. Journal of Parallel and Distributed Computing, Vol. 13, 1991, No. 2, pp. 139-153.
3. BENEŠ, V.: Permutation groups, complexes, and rearrangeable multistage connecting networks. Bell System Technical Journal, Vol. 43, 1964, pp. 1619-1640.
4. BENEŠ, V.: Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, NY, 1965.
5. BAKER, B. - SHOSTAK, R.: Gossips and telephones. Discrete Mathematics, Vol. 2, 1972, No. 1, pp. 191-193.
6. DALLY, W. - SEITZ, C.: Deadlock free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, Vol. 36, 1987, No. 5, pp. 547-553.
7. EVEN, S. - MONIEN, B.: On the number of rounds necessary to disseminate information. In: Proc. 1st ACM Symp. on Parallel Algorithms and Architectures (SPAA '89), 1989, pp. 318-327.
8. ENTRINGER, R. C. - SLATER, P. J.: Gossips and telegraphs. Journal of the Franklin Institute, Vol. 307, 1979, pp. 353-360.
9. FARLEY, A. M.: Minimum-time line broadcast networks. Networks, Vol. 10, 1980, pp. 59-70.
10. FELDMANN, R. - HROMKOVIČ, J. - MADHAVAPEDDY, S. - MONIEN, - B. MYSLIWIETZ, P.: Optimal algorithms for dissemination of information in generalized communication modes. Extended abstract in: Proc. 4th Int. Conf. on Parallel Architectures and Languages Europe (PARLE '92), Lecture Notes in Computer Science 605, Springer-Verlag 1992, 115-130;
11. Full version in: Discrete Applied Mathematics, Vol. 53, 1994, No. 1-3, pp. 55-78.
12. FRAIGNIAUD, P. - LAZARD, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics, Vol. 53, 1994, No. 1-3, pp. 79-133.
13. FUNKE, R. - LÜLING, R. - MONIEN, B. - LÜCKING, F. - BLANKE-BOHNE, H.: An optimized reconfigurable architecture for Transputer networks. In: Proc. 25th Hawaii Int. Conf. on System Sciences (HICSS '92), 1992, Vol. 1, pp. 237-245.
14. FELDMANN, R. - MYSLIWIETZ, P.: The Shuffle Exchange Network has a Hamiltonian Path. Proc. 17th Math. Foundations of Computer Science (MFCS'92), Lecture Notes in Computer Science 629, Springer-Verlag 1992, pp. 246-254.
15. FELDMANN, R. - UNGER, W.: The Cube-connected cycles network is a subgraph of the butterfly network. Parallel Processing Letters, Vol. 2, 1992, No. 1, pp. 13-19.
16. GREENBERG, D. S. - HEATH, L. S. - ROSENBERG, A. L.: Optimal embeddings of butterfly-like graphs in the hypercube. Mathematical Systems Theory, Vol. 23, 1990, pp. 61-77.
17. HEDETNIEMI, S. M. - HEDETNIEMI, S. T. - LIESTMAN, A. L.: A survey of gossiping and broadcasting in communication networks. Networks, Vol. 18, 1988, pp. 319-349.
18. HROMKOVIČ, J. - JESCHKE, C. D. - MONIEN, B.: Optimal algorithms for dissemination of information in some interconnection networks. Extended abstract in: Proc. 15th Int. Symp. on Mathematical Foundations of Computer Science (MFCS '90), Lecture Notes in Computer Science 452, Springer-Verlag 1990, pp. 337-346.
19. Full version in: Algorithmica, Vol. 10, 1993, pp. 24-40.
20. HROMKOVIČ, J. - KLASING, R. - MONIEN, B. - PEINE, R.: Dissemination of information in interconnection networks (broadcasting and gossiping). In: D.-Z. Du and F. Hsu (Eds.): Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125-212.
21. HAJNAL, A. - MILNER, E. C. - SZEMEREDI, E.: A cure for the telephone disease. Canadian Mathematical Bulletin, Vol. 15, 1972, pp. 447-450.
22. HARARY, F. - SCHWENK, A. J.: The communication problem on graphs and digraphs. J. Franklin Institute, Vol. 297, 1974, pp. 491-495.
23. KRUMME, D. W. - CYBENKO, G. - VENKATARAMAN, K. N.: Simultaneous broadcasting in multiprocessor networks. In: Proc. Int. Conf. on Parallel Processing, 1986, pp. 555-558.
24. KRUMME, D. W. - CYBENKO, G. - VENKATARAMAN, K. N.: Gossiping in minimal time. SIAM Journal on Computing, Vol. 21, 1992, No. 1, pp. 111-139.
25. KERMANI, P. - KLEINROCK, L.: Virtual cut-through: A new computer communication switching technique. Computer Networks, Vol. 3, 1979, No. 4, pp. 267-286.
26. KLASING, R. - MONIEN, B. - PEINE, R. - STÖHR, E. A.: Broadcasting in butterfly and deBruijn networks. Extended abstract in: Proc. 9th Symposium on Theoretical Aspects of Computer Science (STAGS '92), Lecture Notes in Computer Science 577, Springer-Verlag 1992, pp. 351-362.
27. Full version in: Discrete Applied Mathematics, Vol. 53, 1994, No. 1-3, pp. 183-197.
28. KNÖDEL, W.: New gossips and telephones. Discrete Mathematics, Vol. 13, 1975, No. 1, p. 95.
29. LEIGHTON, L.: Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes. Morgan Kaufmann Publishers 1992.
30. LEISERSON, C. E. - ABUHAMDEH, Z. S. - DOUGLAS, D. C. - FEYNMAN, C. F. -GANMUKI, M. N. - HILL, J. V. - HILLIS, W. D. - KUSZMAUL, B. C. - ST. PIERRE, M. A. - WELLS, D. S. - WONG, M. C. - YANG, S.-W. - ZAK, R.: The network architecture of the Connection Machine CM-5. In: Proc. 4th ACM Symp. on Parallel Algorithms and Architectures (SPAA '92), 1992, pp. 272-285.
31. LABAHN, R. - WARNKE, I.: Quick gossiping by multi-telegraphs. In: R. Bodendiek, R. Henn (Eds.): Topics in Combinatorics and Graph Theory, Physica-Verlag, Heidelberg 1990, pp. 451-458.
32. LABAHN, R. - WARNKE, I.: Quick gossiping by telegraphs. Discrete Mathematics, Vol. 126, 1994, pp. 421-424.
33. MONIEN, B. - SUDBOROUGH, I. H.: Embedding one interconnection network in another. Computing Supplementum, Vol. 7, 1990, pp. 257-282.
34. SUNDERAM, V. S. - WINKLER, P.: Fast information sharing in a complete network. Discrete Applied Mathematics, Vol. 42, 1993, pp. 75-86.
35. WAKSMAN, A.: A permutation network. Journal of the ACM, Vol. 15, 1968, No. 1, pp. 159-163.