In this paper the fault-tolerant characteristics of the generalized Boolean n-cube network are studied. For processor failures the network is shown to be n+1 (one step) diagnosable. Two efficient algorithms which can diagnose up to n+1 processor failures are presented and their computational complexity are studied.
All Science Journal Classification (ASJC) codes
- 工程 (全部)