Circuit partitioning using a Tabu search approach

Abstract

Tabu Search is a simple combinatorial optimization strategy that has been applied in graph coloring, scheduling, and space planning. The application of the Tabu Search heuristic to the circuit partitioning problem is described. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than the best netlist partitions obtained by using an interchange method or simulated annealing. The Tabu Search method is 3 to 20 times faster than simulated annealing on tested problems. The benefit of integrating Tabu Search with simulated annealing is discussed. >