Multiple Message Broadcasting in the Postal Model

Networks

Volumn 29, Issue 1, 1997, Pages 1-10

  Bar Noy, Amotz ^a,c   Kipnis, Shlomo ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b News Datacom Research Ltd   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345878910     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199701)29:1<1::AID-NET1>3.0.CO;2-P     Document Type: Article

References (13)

1. A. Bar-Noy and S. Kipnis, Designing broadcasting algorithms in the postal model for message-passing systems. Math. Syst. Theory 27(5) (1994) 431-452.
2. A. Bar-Noy and S. Kipnis, Broadcasting multiple messages in simultaneous send/receive systems. Discr. Appl. Math. 55(2) (1994) 95-105.
3. D.P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ (1989).
4. I. Cidon and I. Gopal, PARIS: An approach to integrated high-speed private networks. Int. J. Digital Analog Cabled Syst. 1(2) (1988) 77-85.
5. I. Cidon, I. Gopal, and S. Kutten, New models and algorithms for future networks. 7th Annual ACM Symposium on Principles of Distributed Computing (Aug. 1988) 75-89.
6. I. Cidon, I. Gopal, and S. Kutten, Optimal computation of global sensitive functions in fast networks. Distributed Algorithms, Lecture Notes in Computer Science, Vol. 486. (J. van Leeuwen and N. Santoro, Eds.). Springer-Verlag, New York (1990) 185-191.
7. D. Clark, B. Davie, D. Farber, I. Gopal, B. Kadaba, D. Sincoskie, J. Smith, and D. Tennenhouse, The AURORA gigabit testbed. Comput. Net. ISDN (1991).
8. W. J. Dally, A. Chien, S. Fiske, W. Horwat, J. Keen, M. Larivee, R. Lethin, P. Nuth, S. Wills, P. Carrick, and G. Fyler The J-Machine: A fine-grain concurrent computer. Information Processing 89. Elsevier, IFIP, San Francisco (1989) 1147-1153.
9. J. Dénes and A. D. Keedwell, Latin Squares and Their Applications. Academic Press, New York (1974).
10. P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks. Discr. Appl. Math. 53 (1994) 79-133.
11. S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks. Networks 18(4) (1988) 319-349.
12. C. T. Ho, Optimal broadcasting on SIMD hypercubes without indirect addressing capability. J. Parall. Distrib. Comput. 13(2) (1991) 246-255.
13. IBM T. J. Watson Research Center, Vulcan system summary. Internal memorandum.