We consider the problem of determining the minimum number of faulty processors, κ(n, m), and of faulty links, λ(n, m), in an n-dimensional hypercube computer so that every m-dimensional subcube is faulty. Best known lower bounds for κ(n, m) and λ(n, m) are proved, several new recursive inequalities and new upper bounds are established, their asymptotic behavior for fixed m and for fixed n − m are analyzed, and their exact values are determined for small n and m. Most of the methods employed show how to construct sets of faults attaining the bounds. An extensive survey of related work is also included, showing connections to resource allocation, k-independent sets, and exhaustive testing.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.