Skip to main content
SpringerLink
Log in

Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets

(Extended Abstract)

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3499))

  • 370 Accesses

Abstract

We present optimal solutions for the gossiping problem in square meshes under the all-port, full-duplex (F*) and the all-port, half-duplex (H*) models. We assume packets are of finite size, each carrying at most one message.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bagchi, A., Schmeichel, E.F., Hakimi, S.L.: Sequential information dissemination by packets. Networks 22, 317–333 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bagchi, A., Schmeichel, E.F., Hakimi, S.L.: Parallel information dissemination by packets. SIAM J. Computing 23, 355–372 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bermond, J.-C., Gargano, L., Rescigno, A.A., Vaccaro, U.: Fast gossiping by short messages. In: Proc. Int’l Colloquium Automata, Languages, and Processing 1995, pp. 135–146 (1995)

    Google Scholar 

  4. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. of 41st Annual Symposium on Foundations of Computer Science, pp. 575–581 (2000)

    Google Scholar 

  5. Bermond, J.-C., Gargano, L., Perennes, S.: Optimal sequential gossiping by short messages. Discrete Applied Mathematics 86, 145–155 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dally, W.J., Song, P.: Design of self-timed VLSI multicomputer communication controller. In: Proc. Int’l Conf. Computer Design, pp. 230–234 (1987)

    Google Scholar 

  7. Fraigniaud, P., Lizard, E.: Methods and problems of communication in usual networks. Discrete Applied Math. 53, 79–134 (1994)

    Article  MATH  Google Scholar 

  8. Fujita, S., Yamashita, M.: Fast gossiping on square mesh computers. Information Processing Letters 48, 127–130 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319–349 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hromkovic, J., Klasing, R., Monien, B., Peine, R.: Dissemination of information in interconnection networks (Broadcasting & Gossiping). In: Du, D.-Z., Hsu, D.F. (eds.) Combinatorial Network Theory, pp. 125–212 (1996)

    Google Scholar 

  11. Krumme, D.W.: Fast gossiping for the hypercube. SIAM J. Computing 21(2), 365–380 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lau, F.C.M., Zhang, S.H.: Fast gossiping in square meshes/tori with bounded-size packets. IEEE Trans. on Parallel and Distributed Systems 13(4), 349–358 (2002)

    Article  Google Scholar 

  13. Lau, F.C.M., Zhang, S.H.: Optimal gossiping in paths and cycles. J. of discrete algorithms 1(5-6), 461–475 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. May, M.D., Thompson, P.W., Welch, P.H.: Networks, routers, and transputers. IOS Press, Amsterdam (1993)

    MATH  Google Scholar 

  15. Soch, M., Tvrdik, P.: Optimal gossiping in noncombining 2D meshes. In: Proc. Int’l Colloquium Structural Information Comm. Complexity, SIROCCO 1997 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Hong Kong,  

    Rui Wang & Francis C. M. Lau

Authors
  1. Rui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francis C. M. Lau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique, Université du Québec en Outaouais, J8X 3X7, Gatineau, Québec, Canada

    Andrzej Pelc

  2. IRISA, Université de Rennes, France

    Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, R., Lau, F.C.M. (2005). Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets. In: Pelc, A., Raynal, M. (eds) Structural Information and Communication Complexity. SIROCCO 2005. Lecture Notes in Computer Science, vol 3499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11429647_23

Download citation

  • DOI: https://doi.org/10.1007/11429647_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26052-3

  • Online ISBN: 978-3-540-32073-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation