查詢結果分析
來源資料
相關文獻
- 增加的可延伸雙扭超方體
- Chordal Rings的容錯直徑
- Applying Hashing Search and Fuzzy Fault-Tolerant Algorithms for the Fast Recognition of Multi-Font Printed Chinese Characters
- 旋轉電極銅粉末設備之研製
- 模糊性拜占庭協議[Byzantine Agreement]初探
- 使用切換網路設計容錯多級交連網路
- 開發一個容錯資料庫系統
- On Finding Node-Disjoint Parallel Paths in Rotator Graphs
- Fault-Tolerant Q-Ary K-Cube Networks by Adding Extra Dimensions Based on Coding Theory
- Parallel Routing Paths in Chordal Rings
頁籤選單縮合
題 名 | 增加的可延伸雙扭超方體=An Incrementally Extensible Twisted Cube |
---|---|
作 者 | 黃文增; 黃榆棊; 邱耀慶; 陳錦杏; | 書刊名 | 臺北科技大學學報 |
卷 期 | 34:2 2001.09[民90.09] |
頁 次 | 頁71-83 |
分類號 | 448.6 |
關鍵詞 | 雙扭超方體; 連通性; 直徑; 容錯; Twisted cube; Connectivity; Diameter; Fault-tolerant; |
語 文 | 中文(Chinese) |
中文摘要 | 本文提出一種新的連結網路結構(interconnection network),這種新型連結網路結構稱為增加的可延伸雙扭超方體(Incrementally Extensible Twisted--IETQ)。這種新型的網路的拓樸結構是屬於雙扭超方體(twisted cube)的延伸,它不但保有大部份雙扭超方體的優點而且卻沒有其較嚴格的限制。IETQ的主要優點如下:IETQ可以推廣到包含任意節點(node)數,因此此種網路較為實用;IETQ中各頂點(vertex)的連通性是n,在測量各頂點的連通性後,我們可以證明出這種網路結構具有最大容錯(maximum fault-tolerance)性;又因為IETQ的度數(degree)最大與最小相差是1,所以這種結構幾乎是正規的(regular);而又在IETQ網路中,任意已知兩頂點的最短路徑搜尋演算法,其時間複雜度為O(n²);在與其他競爭者比較後,IETQ的直徑(diameter)僅有其他競爭者的一半,這種較短的直徑有助於減少連結網路的傳輸延遲。 |
英文摘要 | In this paper, a new family of interconnection networks which we call the Incrementally Extensible Twisted Cube (IETQ) is proposed. The proposed topology of network is a novel generalization of the twisted cub. It inherits all the merits of the twisted cube but without the limitations that the twisted cube has. First, this proposed network is incrementally extensible and can be adapted for use in any number of nodes; therefore, this network is particularly well suited for the design of a distributed communication network with an arbitrary number of nodes. Second, the vertex connectivity of this network is n. Measured by this vertex connectivity, we demonstrate that this network is maximum fault-tolerance. And it is almost regular, because the difference between the maximum and minimum degree of any node in this network is at most one. A shortest-path routing algorithm for IETQ with complexity O(n²) is proposed to generate path for any given pair of vertices in the network. Third, comparing with most of the other competitors, the diameter of this network is only half in size. This low diameter helps to reduce the internode communication delay. |
本系統中英文摘要資訊取自各篇刊載內容。