Skip to main content
SpringerLink
Log in

An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d,k)

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

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

  • 754 Accesses

Abstract

Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorithms can only work in binary dBG. In this paper, we investigate broadcasting in bidirectional dBG for a degree greater than or equal to two. A distributed broadcast algorithm for one-to-all broadcasting in the all port communication is proposed for dBG(d,k).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Liu, Z., Sung, T.-Y.: Routing and Transmitting Problem in de Bruijn Networks. IEEE Trans. on Comp. 45(9), 1056–1062 (September 1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Search. Comm. of the ACM 18(6) (June 1975)

    Google Scholar 

  3. Esfahanian, A.H., Zimmerman, G.: A Distributed Broadcast Algorithm for Binary De Bruijn networks. IEEE Conf. on Comp. and Comm. (March 1988)

    Google Scholar 

  4. Ganesan, E., Pradhan, D.K.: Optimal Broadcasting in Binary de Bruijn Networks and Hyper-deBruijn Networks. IEEE Symposium on Parallel Processing (April 1993)

    Google Scholar 

  5. Ohring, S.R., Hondel, D.H.: Optimal Fault-Tolerant Communication Algorithms on Product Networks using Spanning Trees. IEEE Symp. on Parallel Processing (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Kyung Hee Univerity, 1, Seocheon, Giheung, Yongin, Gyeonggi, 449-701, Korea

    Ngoc Chi Nguyen & Sungyoung Lee

Authors
  1. Ngoc Chi Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungyoung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, N.C., Lee, S. (2004). An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d,k). In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation