Optimal domain-based reconfiguration algorithm for WSI processor arrays

The authors address an optimal reconfiguration algorithm based on domain constraint. The domain of a logical cell is a set of physical cells where the logical cell can be assigned. A reconfiguration algorithm is defined as optimal if it can find a solution with minimal channel complexity, whenever there exists at least one within the predefined constraints. A reconfiguration problem with a domain-based reconfiguration can be solved by a maximum matching. For the four-cell domain, the maximum matching algorithm with 3 horizontal and 3 vertical tracks is proved as an optimal reconfiguration algorithm