Reconfiguration of binary trees in faulty hypercubes
Pei-Ji Yang, Cauligi S. Raghavendra · 2002
The authors present a distributed scheme for reconfiguration of embedded binary trees in hypercubes. Their scheme can reconfigure around any 3n/2 faulty nodes in O(n) time, in an n-dimensional hypercube. Their technique, which is based on a key concept called degree of occupancy, can be generalized to any task graph.>