 
Summary: CIRCUIT PARTITIONING
USING MEAN FIELD ANNEALING
Tevfik Bultan
Department of Computer Science,
University of Maryland, College Park, MD 20742, U.S.A.
Cevdet Aykanat
Department of Computer Engineering and Information Science,
Bilkent University, 06533 Bilkent, Ankara, Turkey
Abstract
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
netcut 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 wellknown heuristics, simulated annealing and KernighanLin,
indicates that MFA is a successful alternative heuristic for the circuit partitioning problem.
Keywords : Mean field annealing, circuit partitioning, netcut model.
