Optimal k-fault-tolerant networks for token rings
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
390 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
381 | en_US |
dc.citation.volume |
16 | en_US |
dc.citation.woscount |
3 | |
dc.contributor.author |
Sung, TY | en_US |
dc.contributor.author |
Ho, TY | en_US |
dc.contributor.author |
Chang, CP | en_US |
dc.contributor.author |
Hsu, LH | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:45:21Z | |
dc.date.available |
2014-12-08T15:45:21Z | |
dc.date.issued |
2000-05-01 | en_US |
dc.description.abstract |
Fault-tolerant multiprocessors are widely used in on-line transaction processing. Fault tolerance is also desirable in massively parallel systems that have a relatively high failure probability. Two types of failures in a multiprocessor system are of interest, processor failures and link failures. Most of the previous research in designing optimal fault-tolerant topologies was concentrated on the cases that only processor failures were allowed [1, 2, 4, 6], or the cases that only link failures were allowed [3, 5, 7, 8, 11-15]. In this paper, we discuss the case of a combination of processor failures and link failures for token rings. By "k faults" we mean k-component faults in any combination of processor faults and link faults. Designing an optimal k-fault-tolerant network for token rings is equivalent to constructing an optimal k-hamiltonian graph, where k is a positive integer and corresponds to the number of faults. A graph G is k-hamiltonian if G - F is hamiltonian for any sets F subset of V boolean OR E with F less than or equal to k. An n-node k-hamiltonian graph is optimal if it contains the least number of edges among all n-node k-hamiltonian graphs. In this paper, we construct optimal k-hamiltonian graphs with k = 2 and 3, which are optimal k-fault-tolerant networks with respect to token rings. | en_US |
dc.identifier.issn |
1016-2364 | en_US |
dc.identifier.journal |
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/30562 | |
dc.identifier.wosnumber |
WOS:000088130200005 | |
dc.language.iso |
en_US | en_US |
dc.subject |
distributed systems | en_US |
dc.subject |
fault tolerance | en_US |
dc.subject |
hamiltonian cycles | en_US |
dc.subject |
hamiltonian graphs | en_US |
dc.subject |
processor failures | en_US |
dc.subject |
link failures | en_US |
dc.subject |
token rings | en_US |
dc.title |
Optimal k-fault-tolerant networks for token rings | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Sung, T., Ho, T., Chang, C., & Hsu, L. (2000). Optimal k-fault-tolerant networks for token rings. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 16(3), 381–390. https://ir.lib.nycu.edu.tw/handle/11536/30562
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30562