Parallel Simulated Annealing Algorithm for Standard Cell Placement in VLSI Design

Aaquil Bunglowala, Manisha Jain
2014 International Journal of Computer Applications  
Simulated Annealing (SA) is a stochastic based heuristic optimization technique based on physical process of metal crystallization. Optimization of Non-Deterministic polynomial hard (NP-hard) problems of non-trivial sizes is done using heuristic approach. Until now, simulated annealing (SA), genetic algorithm (GA) and Hopfield neural network (HNN) were individually used for solving the standard cell placement (SCP) problem. Simulated annealing established as a powerful SCP optimization tool,
more » ... timization tool, its drawback has always been its appetite for computational resources. In light of this, we are interested in the application of these parallel simulated annealing algorithms with respect to standard cell placement. Several generalized algorithms proposed for parallelizing simulated annealing, only a few have been applied to cell placement. Parallel moves has been the most popular strategy and in this paper we present a new implementation of this approach.
doi:10.5120/15172-3047 fatcat:k5veubtt4rbtljxt2hc7x2tjr4