English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109948/140897 (78%)
Visitors : 46101550      Online Users : 805
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/75558
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75558

    Title: All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
    Authors: Chang, F.-H
    Chen, Young-Ming
    Chia, M.-L
    Contributors: 應數系
    Yu, Ming Fen
    Keywords: Communication;Forestry;All-to-all broadcast;All-to-all communication;Complete bipartite graphs;Double loop networks;Number of trees;Parallel processing;Tree;Upper and lower bounds;Trees (mathematics);Communication;Forestry;Mathematics;Trees
    Date: 2014-08
    Issue Date: 2015-06-04 11:25:35 (UTC+8)
    Abstract: All-to-all communication occurs in many important applications in parallel processing. In this paper, we study the all-to-all broadcast number (the shortest time needed to complete the all-to-all broadcast) of graphs under the assumption that: each vertex can use all of its links at the same time, and each communication link is half duplex and can carry only one message at a unit of time. We give upper and lower bounds for the all-to-all broadcast number of graphs and give formulas for the all-to-all broadcast number of trees, complete bipartite graphs and double loop networks under this model. © 2014 Elsevier B.V. All rights reserved.
    Relation: Discrete Applied Mathematics, 173, 28-34
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.dam.2014.03.014
    DOI: 10.1016/j.dam.2014.03.014
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    28-34.pdf634KbAdobe PDF2954View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    著作權政策宣告 Copyright Announcement
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback