A Study of Fault-Tolerant Routing on Star Graph Using Limited- Global-Information
碩士 === 國立台灣工業技術學院 === 電機工程技術研究所 === 85 === In this thesis, we study the problem of fault-tolerant communication in star graphs multicomputers in which components may fail. We propose the concept of safety levels which respect to the dista...
Main Authors: | Chang, Chin-Hua, 張晉華 |
---|---|
Other Authors: | Chiu Ge-Ming |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/47163772362489807277 |
Similar Items
-
Fault-Tolerant Routing on the Star Graph Using Safety Vectors
by: Sheng-I Yeh, et al. -
k-pairwise cluster fault tolerant routing in star graphs
by: Xu, Zhen-Tong, et al.
Published: (1997) -
Fault-Tolerant Ring Embedding in Star Graphs
by: Chang Shu Hui, et al.
Published: (1995) -
Optimal Fault-Tolerant Hamiltonicity of Star Graphs with Conditional Edge Faults
by: Chang-De Wu, et al.
Published: (2007) -
A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph
by: Chiao-Wei Chiu, et al.
Published: (2008)