In this paper, wepropose a heuristic procedure forfinding near-ovtimal vlacement of WSI circuit modules on a twodime&ionalA layout. This heuristic procedure combines ideas from a greea'y placement algorithm and the Probabilistic Hill-Climbing technique. The main advantage of this alpproach is that while it retains the fast convetgence property of the greedy algorithm, it exhibits adaptive hillclimbing capability. Pefonnance evaluation studies on this algorithm have been carried out and the results appear promising. The results indicate that while the algorithm is computationally less expensive than the simulated annealing algorithm, it yields betterfinalplacement solutions than the greedy algorithm.
['Rajib Mall', 'Lalit M. Patnaik']
A Force Directed Hill-Climbing Placement Algorithm