Thumbnail
Access Restriction
Subscribed

Author Shahookar, K. ♦ Mazumder, P.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1991
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword VLSI ♦ Floor planning ♦ Force-directed placement ♦ Gate array ♦ Genetic algorithm ♦ Integrated circuits ♦ Layout ♦ Min-cut ♦ Physical design ♦ Placement ♦ Simulated annealing ♦ Standard cell
Abstract VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard cell and macro placement. Five major algorithms for placement are discussed: simulated annealing, force-directed placement, min-cut placement, placement by numerical optimization, and evolution-based placement. The first two classes of algorithms owe their origin to physical laws, the third and fourth are analytical techniques, and the fifth class of algorithms is derived from biological phenomena. In each category, the basic algorithm is explained with appropriate examples. Also discussed are the different implementations done by researchers.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1991-06-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 23
Issue Number 2
Page Count 78
Starting Page 143
Ending Page 220


Open content in new tab

   Open content in new tab
Source: ACM Digital Library