淡江大學機構典藏:Item 987654321/27404
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 60861/93638 (65%)
造訪人次 : 1106115      線上人數 : 25
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/27404


    題名: Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube
    作者: Lin,Jen-Chih;Chi, Tzong-Heng;Keh, Huan-Chao;Liou, Ay-Hwa Andy
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: Algorithms;Computer networks;Embedded systems;Fault tolerant computer systems;Trees (mathematics);Binary trees;Computer architecture
    日期: 2001-06
    上傳時間: 2013-06-13 11:28:14 (UTC+8)
    出版者: Amsterdam: Elsevier BV * North-Holland
    摘要: Although the embedding of complete binary trees in faulty hypercubes has received considerable attention, to our knowledge, no paper has demonstrated how to embed a complete binary tree in a faulty Flexible Hypercube. Therefore, this investigation presents an algorithm to facilitate the embedding job when the Flexible Hypercube contains faulty nodes. Of particular concern are the network structures of the Flexible Hypercube that balance the load before as well as after faults start to degrade the performance of the Flexible Hypercube. Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n−2) faults can be tolerated with congestion 1, dilation 4 and load 1.
    關聯: Journal of Systems Architecture 47(7), pp.543-548
    DOI: 10.1016/S1383-7621(01)00004-2
    顯示於類別:[資訊管理學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    1383-7621_47(7)p543-548.pdf70KbAdobe PDF235檢視/開啟
    Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube.pdf70KbAdobe PDF1檢視/開啟
    index.html0KbHTML39檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋