Advertisement

4-Systolic Broadcasting in a Wrapped Butter.y Network

  • Ganesh Narayanaswamy
  • Anil M. Shende
  • Praveen Vipranarayanan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2571)

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.

Keywords

Interconnection Network Respective Time Broadcast Message Straight Edge Broadcast Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.CrossRefGoogle Scholar
  2. 2.
    Flammini and Perennes. Lower bounds on systolic gossip. In IPPS: 11th International Parallel Processing Symposium. IEEE Computer Society Press, 1997.Google Scholar
  3. 3.
    Michele Flammini and Stephane Perennes. Lower bounds on the broadcasting and gossiping time of restricted protocols. Technical Report RR-3612.Google Scholar
  4. 4.
    Satoshi Fujita, Stephane Perennes, and Joseph G. Peters. Neighbourhood gossiping in hypercubes. Technical report, Simon Fraser University, 1997.Google Scholar
  5. 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.zbMATHMathSciNetGoogle Scholar
  6. 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. 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. 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. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ganesh Narayanaswamy
    • 1
  • Anil M. Shende
    • 2
  • Praveen Vipranarayanan
    • 1
  1. 1.Birla Institute of Technology & SciencePilaniIndia
  2. 2.Roanoke CollegeSalemUSA

Personalised recommendations