Advertisement

Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode

(Extended Abstract)
  • Hans-Joachim Böckenhauer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1517)

Abstract

A new communication mode for the dissemination of information among processors of interconnection networks via vertex-disjoint paths is introduced and investigated. In this communication mode, in one communication step two processors communicating via a path P send their pieces of information to all other processors on this path, too. The complexity of a communication algorithm is measured by the number of communication steps (rounds).

The main results are optimal (or nearly optimal, up to one round) broadcast, accumulation, and gossip algorithms for paths, cycles, complete graphs, two-dimensional grids, hypercubes and hypercube-like networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bollobas, B.: Graph Theory. Springer, New York (1979)CrossRefzbMATHGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  3. 3.
    Even, S.: Graph Algorithms. Pitman, London (1979)zbMATHGoogle Scholar
  4. 4.
    Farley, A.M.: Minimum-Time Line Broadcast Networks. Networks 10, 5970 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Feldmann, R., Hromkovič, J., Madhavapeddy, S., Monien, B., Mysliwietz, P.: Optimal Algorithms for Dissemination of Information in Generalized Communication Modes. Discrete Applied Mathematics 53(1-3), 55–78 (1994)Google Scholar
  6. 6.
    Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53(1-3), 79–133 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Feldmann, R., Mysliwietz, P.: The Shuffle Exchange Network has a Hamiltonian Path. Mathematical Systems Theory 29(5), 471–485 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks 18, 319–349 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Hromkovič, J., Klasing, R., Monien, B., Peine, R.: Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). In: Du, D.-Z., Hsu, F. (eds.) Combinatorial Network Theory, pp. 125–212. Kluwer Academic Publishers, Dordrecht (1995)Google Scholar
  10. 10.
    Hromkovič, J., Klasing, R., Stöhr, E.A.: Dissemination of Information in Vertex-Disjoint Paths Mode. Computers and Artificial Intelligence 15(4), 295–318 (1996)Google Scholar
  11. 11.
    Hromkovič, J., Klasing, R., Stöhr, E.A., Wagener, H.: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Information and Computation 123(1), 17–28 (1995)Google Scholar
  12. 12.
    Hromkovič, J., Klasing, R., Unger, W., Wagener, H.: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Information and Computation 133(1), 1–33 (1997)Google Scholar
  13. 13.
    Hromkovič, J., Loryś, K., Kanarek, P., Klasing, R., Unger, W., Wagener, H.: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hy-percube Algorithms on Bounded-Degree Networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 255–266. Springer, Heidelberg (1995)Google Scholar
  14. 14.
    Klasing, R.: On the Complexity of Broadcast and Gossip in Different Communication Modes (Dissertation). Shaker Verlag, Aachen (1996)Google Scholar
  15. 15.
    Klasing, R.: The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. Discrete Applied Mathematics 82(1-3), 227–244 (1998)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Hans-Joachim Böckenhauer
    • 1
  1. 1.Lehrstuhl für Informatik IRWTH AachenAachenGermany

Personalised recommendations