- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Sparse networks tolerating random faults for tree-like and butterfly-like networks
Description
A network G* is called an RFT (random-fault-tolerant) network for a network G if G* contains a fault-free isomorphic copy of G with high probability even if processors fail independently with constant probability. This paper shows that if G is an N-processor partial k-tree, butterfly, wrapped butterfly, or Benes network then we can construct an RFT networks for G with O(N) processors and O(N log N) communication links.
Journal
-
- IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394)
-
IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394) 799-802, 2002-11-11
IEEE