Solution space reduction of sequence pairs using model placement

This paper proposes a reduced solution space for the sequence-pair based placement. Assuming that some “model placement” is given, we will extract relative spatial relation between modules from it. Based on this extracted information, we will impose some constraints on permutations Γ
+
and Γ
−
of modules in a sequence pair code in order to reduce the solution space without losing good solutions. As a practical implementation of this concept, the result of the so called “Force Directed Placement” is used as our model placement, constraints are extracted from it, and Simulated Annealing is applied to the reduced sequence-pair solution space. The experimental results show us that the combination of the reduced solution space with SA search has an excellent potential in wire length minimization while keeping a comparable potential in area minimization.