查詢結果分析
來源資料
相關文獻
- Parallel Routing Paths in Chordal Rings
- On Finding Node-Disjoint Parallel Paths in Rotator Graphs
- Applying Hashing Search and Fuzzy Fault-Tolerant Algorithms for the Fast Recognition of Multi-Font Printed Chinese Characters
- 模糊性拜占庭協議[Byzantine Agreement]初探
- 使用切換網路設計容錯多級交連網路
- 開發一個容錯資料庫系統
- Fault-Tolerant Q-Ary K-Cube Networks by Adding Extra Dimensions Based on Coding Theory
- A Fault-Tolerant Model for Replication in Distributed-File Systems
- Nondominated (K, M)-Coteries for the K-out of-M Resources Allocation Problme
- Fault Tolerant Training of Eeedforward Neural Networks
頁籤選單縮合
題 名 | Parallel Routing Paths in Chordal Rings=Chordal Rings的平行繞徑 |
---|---|
作 者 | 林宏仁; | 書刊名 | 國立臺北商專學報 |
卷 期 | 53 1999.12[民88.12] |
頁 次 | 頁215-229 |
分類號 | 448.6 |
關鍵詞 | 節點不重複平行路徑; 容錯; 常數時間; Chordal rings; Node disjoint paths; Fault tolerance; Scattering; Constant time; Chordal ring; |
語 文 | 英文(English) |
中文摘要 | 一個Chordal ring G(n; c)是將一個具有n個點的環狀架構加上一些邊,對某些點 i 來說,所加上的邊是連接點 i+n。就如同我們所知,資料通訊在平行架構之下是一個很重 要的議題,在本篇文章中, 我們將提供在 Chordal rings 中找出單點對單點的平行路徑, 而這些路徑將被證明是節點不重覆。 由於任一 Chordalr ring 的分支度是 4,因此本演算 法所找出的平行路徑個數亦是 4。 單點對單點的平行路徑可以用在容錯, 例如我們可以找到 4 條節點不重覆平行路徑, 一旦至多 3 個點發生故障,資料封包依然可以成功傳輸。 而本文章的演算法可以在常數時 間內完成。 |
英文摘要 | A chordal ring G(n; c) is a ring of nodes with chords connecting each vertex; to the vertex (i+c). As we know, data communication is an important issue in parallel interconnection networks. In this paper, we give algorithms for finding the parallel paths from one node to another node in a chordal ring. These paths are shown to be node disjoint. Since the degree of a chordal ring is four, thus the number of these parallel paths is four. One-to-one parallel paths can be used for fault tolerance, for example, there are four node disjoint paths can be found from one node to the other node, once there are at most three nodes fault, the packets can still be transmitted successfully. Our one-to-one parallel path algorithms can be done in constant time. |
本系統中英文摘要資訊取自各篇刊載內容。