ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A Force Directed Hill-Climbing Placement Algorithm

Mall, R and Patnaik, LM (1992) A Force Directed Hill-Climbing Placement Algorithm. In: The Fifth International Conference on VLSI Design, 1992, 4-7 January, Bangalore,India, pp. 251-254.

[img]
Preview
PDF
15.pdf

Download (414Kb)

Abstract

In this paper, we propose a heuristic procedure for finding near-optimal placement of VLSI circuit modules on a two dimensional layout. This heuristic procedure combines ideas from a greedy placement algorithm and the Probabilistic Hill-Climbing technique. The main advantage of this alpproach is that while it retains the fast convergence property of the greedy algorithm, it exhibits adaptive hill climbing 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 better final placement solutions than the greedy algorithm.

Item Type: Conference Paper
Additional Information: Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 25 Aug 2008
Last Modified: 19 Sep 2010 04:27
URI: http://eprints.iisc.ernet.in/id/eprint/6882

Actions (login required)

View Item View Item