Summary: CIRCUIT PARTITIONING
USING MEAN FIELD ANNEALING
Department of Computer Science,
University of Maryland, College Park, MD 20742, U.S.A.
Department of Computer Engineering and Information Science,
Bilkent University, 06533 Bilkent, Ankara, Turkey
Mean field annealing (MFA) algorithm, proposed for solving combinatorialoptimizationproblems,
combines the characteristics of neural networks and simulated annealing. Previous works on MFA
resulted with successful mapping of the algorithm to some classic optimization problems such
as traveling salesperson problem, scheduling problem, knapsack problem and graph partitioning
problem. In this paper, MFA is formulated for the circuit partitioning problem using the so called
net-cut model. Hence, the deficiencies of using the graph representation for electrical circuits are
avoided. An efficient implementation scheme, which decreases the complexity of the proposed
algorithm by asymptotical factors is also developed. Comparative performance analysis of the
proposed algorithm with two well-known heuristics, simulated annealing and Kernighan-Lin,
indicates that MFA is a successful alternative heuristic for the circuit partitioning problem.
Keywords : Mean field annealing, circuit partitioning, net-cut model.