Reconfiguration: an Algorithm for Dynamically Balancing the Computation Load on a Tree Structure Embedded in a Hypercube Parallel Computer.

A ''Divide and Conquer'' (D&C) algorithm enriched with a dynamic reconfiguration is discussed. The algorithm has been designed to run on a tree structure embedded in a hypercube. Application on symbolic normal form computations (on a 64-node nCUBE2 computer) showed that under certain conditions ''D&C with Reconfiguration'' may perform considerably better than pure D&C.