Fast collective communication by Packets in the postal model

Networks

Volumn 31, Issue 2, 1998, Pages 67-79

  Gargano, Luisa ^a   Rescigno, Adele A ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039992138     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199803)31:2<67::AID-NET2>3.0.CO;2-H     Document Type: Article

References (31)

1. A. Bagchi, E. F. Schmeichel, and S. L. Hakimi, Parallel information dissemination by packets. SIAM J. Comput. 23 (1994) 355-372.
2. V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C. T. Ho, S. Kipnis, and M. Shnir, CCL: A portable and tunable collective communication library for scalable parallel computers. IEEE Trans. Parallel Distrib. Systm. 6 (1995) 154-164.
3. A. Bar-Noy, J., Bruck, C. T. Ho, S. Kipnis, and B. Schieber, Efficient global combine operations in the multi-port postal model. IEEE Trans. Parallel Distrib. Syst. 6 (1995) 896-900.
4. A. Bar-Noy and S. Kipnis, Designing broadcasting algorithms in the postal model for message passing systems. Math. Syst. Theory 27 (1994) 431-452.
5. A. Bar-Noy and S. Kipnis, Multiple message broadcasting in the postal model. Networks 29(1) (1997) 1-10.
6. A. Bar-Noy, S. Kipnis, and B. Schieber, An optimal algorithm for computing census functions in message passing systems. Parallel Process. Lett. 3 (1993) 19-23.
7. A. Bar-Noy, S. Kipnis, and B. Schieber, Optimal computation of census functions in the postal model. Discr. Appl. Math. 58 (1995) 213-222.
8. J.-C. Bermond, L. Gargano, A. A. Rescigno, and U. Vaccaro, Fast gossiping by short messages. SIAM J. Comput., to appear.
9. J.-C. Bermond, S. Perennes, and T. Kodate, Gossiping in Cayley graphs by packets. Proceedings of the 8-th French-Japanese Conference on Combinatorics and Computer Science, Brest (July 1995).
10. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ (1989).
11. J. Bruck, R. Cypher, L. Garavano, A. Ho, C. T. Ho, S. Kipnis, S. Konstantinidou, M. Snir, and E. Upfal, Survey of routing issues for the Vulcan parallel computer. IBM Research Report RJ-8839 (1992).
12. J. Bruck, L. de Coster, N. Dewulf, C. T. Ho, and R. Lauwereins, On the design and implementation of broadcast and global combine operations using the postal model. IEEE Trans. Parallel Distrib. Syst. 7 (1996) 256-265.
13. J. Bruck, C.-T. Ho, S. Kipnis, and D. Weathersby, Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE Trans. Parallel Distrib. Syst., 8(12) (1997).
14. B. S. Chlebus, K. Diks, and A. Pelc, Optimal gossiping with short unreliable messages. Discr. Appl. Math. 53 (1994) 15-24.
15. Connection Machine CM-5 Technical Summary. Thinking Machines Corp. (1991).
16. K. Diks and A. Pelc, Efficient gossiping by packets in networks with random faults. SIAM J. Discr. Math. 9(1) (1996) 7-18.
17. Document for a Standard Message-Passing Interface. Message-Passing Interface Forum, University of Tennessee, TR CS-93-214 (1993).
18. Express 3.0 Introductory Guide. Parasoft Corp. (1990).
19. G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors. Prentice-Hall, Englewood Cliffs, NJ 1 (1988).
20. S. Fujita, Gossiping in mesh-bus computers by packets with bounded length. IPS Jpn. SIGAL 36(6) (1993) 41-48.
21. L. Gargano, U. Vaccaro, and A. A. Rescigno, Communication complexity of gossiping by packets. Proceedings of Fifth Scandinavian Workshop on Algorithm Theory (SWAT'96), Reykjavik, Iceland (July 3-5, 1996).
22. G. A. Geist and V. S. Sunderam, Network based concurrent computing on the PVM system. ORNL Technical Report, ORNL/TM-11760 (1991).
23. R. M. Karp, A. Sahay, E. E. Santos, and K. E. Schauser, Optimal broadcast and summation in the LogP model. Proceeding of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 93), Velen, Germany (1993) 142-153.
24. S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman, A survey of gossiping and broadcasting in communication networks. Networks 18 (1988) 129-134.
25. A. Hily and D. Sotteau, Communications in bus networks. Parallel and Distributed Computing (M. Cosnard, A. Ferreira, and J. Peters, Eds.). Lectures Notes in Computer Science 805. Springer-Verlag, (1994) 197-206.
26. J. Hromkovič, R. Klasing, B. Monien, and R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping). Combinatorial Network Theory (F. Hsu and D.-Z. Du, Eds.). Kluwer, (1995) 125-212.
27. S. L. Johnsson and C. T. Ho, Matrix multiplication on Boolean cubes using generic communication primitives. Parallel Processing and Medium-Scale Multiprocessors (A. Wouk, Ed.). SIAM (1989) 108-156.
28. D. W. Krumme, K. N. Venkataraman, and G. Cybenko, Gossiping in minimal time. SIAM J. Comput. 21 (1992) 111-139.
29. R. Ravi, Rapid rumor ramification: approximating the minimum broadcasting time. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS'94) (1994) 202-213.
30. V. S. Sunderam and P. Winkler, Fast information sharing in a complete network. Discr. Appl. Math. 42 (1993) 75-86.
31. O. Wolfson and A. Segall, The communication complexity of atomic commitment and of gossiping. SIAM J. Comput. 20 (1991) 423-450.