Hypercubes are viewed as good candidates for parallel processing, because a
number of topologies, such as rings, trees, and meshes, can be mapped onto
the hypercubes. In this paper, we study a system level diagnosis method fo
r clustered faults in hypercube systems. We investigate the local and globa
l performance of the method under the Bernoulli failure distribution. We de
monstrate that the diagnosis scheme can identify almost all processors succ
essfully even if the percentage of fault-free processors is low (much lower
than 50%) while almost all processors are guaranteed to be correctly ident
ified.