Skip to main content
SpringerLink
Log in

Optimal group gossiping in hypercubes under wormhole routing model

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

  • 151 Accesses

Abstract

This paper introduces a new gossiping problem of exchanging tokens among specified nodes. We call this problem the group gossiping problem. The group gossiping problem is a generalization of the usual gossiping problem, which has been investigated extensively during the last decade. In this paper, we consider the gossiping problem in n-cubes under the wormhole routing model, which is a model of the communication by the wormhole switching. We propose an asymptotically optimal group gossiping algorithm for n-cubes under the model.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bagchi, S. L. Hakimi. J. Mitchem, and E. Schmeichel. Parallel algorithms for gossiping by mail. Inform. Process. Lett., 34:197–202, April 1990.

    Google Scholar 

  2. W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection network. IEEE Trans. Comput., 36(5):547–553, May 1987.

    Google Scholar 

  3. R. C. Entringer and P. J. Slater. Gossips and telegraphs. J. Franklin Inst., 307:353–360, 1979.

    Article  Google Scholar 

  4. A. M. Farley. Minimum-time line broadcast networks. Networks, 10:59–70, 1980.

    Google Scholar 

  5. C. J. Glass and L. M. Ni. Adaptive routing in mesh-connected networks. In Proc. ICDC '92, pages 12–19. IEEE, 1992.

    Google Scholar 

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

    Google Scholar 

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

    MathSciNet  Google Scholar 

  8. D. W. Krumme, G. Cybenko, and K. N. Venkataraman. Gossiping in minimal time. SIAM J. Comput, 21(1):111–139, February 1992.

    MathSciNet  Google Scholar 

  9. A. Sengupta and S. Bandyopadhayay. Deadlock-free routing in k-ary hypercube network in presence of processor failures. Inform. Process. Lett., 34:323–328, May 1990.

    MathSciNet  Google Scholar 

  10. A. Trew and G. Wilson, editors. Past, Present, Parallel: A Survey of Available Parallel Computer Systems, chapter 4, pages 125–147. Springer-Verlag, 1991.

    Google Scholar 

  11. H. Xu, P. K. McKinley, and L. M. Ni. Efficient implementation of barrier sychronization in wormhole-routed hypercube multicomputers. In Proc. ICDC '92, pages 118–125. IEEE, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering Faculty of Engineering, Hiroshima University, Kagamiyama 1-4-1, 724, Higashi-Hiroshima, Japan

    Satoshi Fujita, Masafumi Yamashita & Tadashi Ae

Authors
  1. Satoshi Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masafumi Yamashita
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tadashi Ae
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujita, S., Yamashita, M., Ae, T. (1993). Optimal group gossiping in hypercubes under wormhole routing model. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_258

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_258

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation