English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41635719      線上人數 : 1277
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29140


    題名: Achieving fault-tolerant multicast in injured wormhole-routed tori and meshes based on Euler path construction
    作者: Tseng,YC;Yang,MH;Juang,TY
    貢獻者: 資訊工程研究所
    關鍵詞: ROUTING TECHNIQUES;NETWORKS;COMMUNICATION;HYPERCUBES;MULTICOMPUTERS;ALGORITHMS;MODEL
    日期: 1999
    上傳時間: 2010-06-29 20:14:40 (UTC+8)
    出版者: 中央大學
    摘要: Recently, wormhole routers with multidestination capability have been proposed to support fast multicast in a multicomputer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants in the network, perhaps with some degree of support of virtual channels [1], [14], [15], [18], [23]. In this paper, we identify that a network which is itself Eulerian or is Eulerian after some links are removed, can enjoy the multidestination capability without support of virtual channels. From this definition, we then develop several techniques to achieve fault-tolerant multicast in a torus/mesh of any dimension with regular fault patterns (such as single node, block, L-shape, T-shape, +-shape, U-shape, and H-shape) and even irregular fault patterns. The result improves over existing results on the requirement of support of virtual channels and fault-tolerant capability. Simulation results on tori are presented.
    關聯: IEEE TRANSACTIONS ON COMPUTERS
    顯示於類別:[資訊工程研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML449檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 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 ©   - 隱私權政策聲明