• DocumentCode
    788760
  • Title

    An optimal broadcasting algorithm without message redundancy in star graphs

  • Author

    Sheu, Jang-Ping ; Wu, Chao-Tsung ; Chen, Tzung-Shi

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
  • Volume
    6
  • Issue
    6
  • fYear
    1995
  • fDate
    6/1/1995 12:00:00 AM
  • Firstpage
    653
  • Lastpage
    658
  • Abstract
    Based on the V.E. Mendia and D. Sarkar´s algorithm (1992), we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O(n log2 n) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O(m log2 n+n log2 n) time due to the nonredundant property of our broadcasting algorithm
  • Keywords
    distributed algorithms; multiprocessor interconnection networks; broadcasting algorithm; distributed broadcasting algorithm; nonredundant property; optimal broadcasting algorithm; star graphs; Broadcasting; Chaotic communication; Computer science; Councils; Distributed computing; Multiprocessor interconnection networks; Partitioning algorithms; Pipelines; Telecommunication traffic; Traffic control;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.388046
  • Filename
    388046
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=788760