English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70585/70585 (100%)
Visitors : 23116238      Online Users : 507
RC Version 7.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


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29147


    Title: Congestion-free, dilation-2 embedding of complete binary trees into star graphs
    Authors: Tseng,YC;Chen,YS;Juang,TY;Chang,CJ
    Contributors: 資訊工程研究所
    Keywords: INTERCONNECTION NETWORK
    Date: 1999
    Issue Date: 2010-06-29 20:14:50 (UTC+8)
    Publisher: 中央大學
    Abstract: Trees are a common structure to represent the intertask communication pattern of a parallel algorithm. In this paper, we consider the embedding of a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: (i) a congestion-free, dilation-2, load-1 embedding of a level-p binary tree, and (ii) a congestion-free, dilation-2, load-2(k) embedding of a level-(p + k) binary tree, into an n-dimensional star graph, where p = Sigma(i=2)(n) [log i] = Omega(n log n) and k is any positive integer. The first result offers a tree of size comparable or superior to existing results, but with less congestion and dilation. The second result provides more flexibility in the embeddable tree sizes compared to existing results. (C) 1999 John Wiley & Sons, Inc.
    Relation: NETWORKS
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML306View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明