Skip to main content
Springer Nature Link
Log in

4-Systolic Broadcasting in a Wrapped Butter.y Network

  • Conference paper
  • First Online:
Distributed Computing (IWDC 2002)

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

Included in the following conference series:

Abstract

In this paper we present a 4-systolic algorithm for broadcasting, in the one-port model, in an undirected d-dimensional (d even) wrapped butterfly. We prove that the broadcast time for the algorithm is no more than 5d/2 — 2, hence making it the fastest known algorithm of this nature for broadcasting in a wrapped butterfly.

This algorithm was first proposed by Dr. André Raspaud at Université Bordeaux 1, France, conveyed to Dr. Joseph G. Peters at Simon Fraser University, Canada, and subsequently conveyed to us by Dr. Sunil Shende at Rutgers University at Camden, New Jersey, USA.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. A.L. Liestman and D. Richards. Network communication in edge-colored graphs: gossiping. In IEEE Trans. Par. Distr. Syst., pages 4:438–445. 1993.

    Article  Google Scholar 

  2. Flammini and Perennes. Lower bounds on systolic gossip. In IPPS: 11th International Parallel Processing Symposium. IEEE Computer Society Press, 1997.

    Google Scholar 

  3. Michele Flammini and Stephane Perennes. Lower bounds on the broadcasting and gossiping time of restricted protocols. Technical Report RR-3612.

    Google Scholar 

  4. Satoshi Fujita, Stephane Perennes, and Joseph G. Peters. Neighbourhood gossiping in hypercubes. Technical report, Simon Fraser University, 1997.

    Google Scholar 

  5. J. Hromkovic, R. Klasing, D. Pardubska, W. Unger, and H. Wagener. The complexity of systolic dissemination of information in interconnection networks. In R.A.I.R.O. Theoretical Informatics and Applications, pages 28(3–4):303–342. 1994.

    MATH  MathSciNet  Google Scholar 

  6. Juran Hromkovic, Ralf Klasing, Burkhand Monien, and Regine Peine. Dissemination of information in interconnection networks (broadcasting and gossiping). in Combinatorial Network Theory.

    Google Scholar 

  7. H.T. Kung. Let’s design algorithms for VLSI systems. In Proc. of the Caltech Conference of VLSI (CL.L. Seifz Ed.), pages 65–90, Pasadena, California, 1979.

    Google Scholar 

  8. Snehal Joshi and Praveen Vipranarayanan. Broadcasting in a wrapped butterfly network. In TechFiesta: PSG College of Technology, Coimbatore, 2001. see http://citeseer.nj.nec.com/joshi01broadcasting.html.

  9. R. Klasing, B. Monien, R. Peine, and E. Stohr. Broadcasting in butterfly and deBruijn networks. In Discrete Applied Mathematics, pages 53(1–3):183–197. 1994.

    Article  MATH  MathSciNet  Google Scholar 

  10. S. Perennes. Lower bounds on broadcasting time of deBruijn networks. In 2nd Int. Euro-Par Conference, volume 1123 ofLecture notes in computer Science, pages 325–332. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Birla Institute of Technology & Science, 333031, Pilani, India

    Ganesh Narayanaswamy & Praveen Vipranarayanan

  2. Roanoke College, Salem, 24153, VA, USA

    Anil M. Shende

Authors
  1. Ganesh Narayanaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anil M. Shende
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Praveen Vipranarayanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Texas at Arlington Center for Research in Wireless Mobility and Networking (CReWMaN), P.O. Box 19015, 76019-0015, Arlington, TX, USA

    Sajal K. Das

  2. Department of Computer Science and Engineering, Jadavpur University, 700 032, Calcutta

    Swapan Bhattacharya

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Narayanaswamy, G., Shende, A.M., Vipranarayanan, P. (2002). 4-Systolic Broadcasting in a Wrapped Butter.y Network. In: Das, S.K., Bhattacharya, S. (eds) Distributed Computing. IWDC 2002. Lecture Notes in Computer Science, vol 2571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36385-8_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36385-8_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00355-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation