A Placement Algorithm for Polycell LSI and its Evaluation
Design Automation ConferencePublished 1 January 1982
Takashi Kambe, T. Chiba, Seiji Kimura, Tsuneo Inufushi, Noboru Okuda, Ikuo Nishioka
Citations14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
An automatic placement algorithm for standard cell and polycell LSI is described, which is constructed on the basis of heuristics for a set of interrelated placement subproblems. The algorithm is incorporated into a hierarchical layout system intended not only for standard cell and polycell LSI but for general cell LSI, by which standard cell and polycell LSI have begun to be laid out in practice. A part of implementation results are also shown to reveal how high the layout performance of the placement program.
Keywords
Engineering
Bell System Technical JournalAn Efficient Heuristic Procedure for Partitioning Graphs
5,218 Citations1970Brian W. Kernighan, Shang Min Lin
A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
A proper model for the partitioning of electrical circuits
195 Citations1972D. G. Schweikert, Brian W. Kernighan
This paper expands on several aspects of the discrepancy: 1) its source, 2) the circumstances under which it is likely to be significant, and its magnitude for typical circuits, and 3) the comparative difficulty and expense of using a more appropriate representation.
Design Automation ConferenceA Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation
162 Citations1979Ulrich Lauther
Clustering and linear placement
138 Citations1972Donald M. Schuler, Ernst G. Ulrich
Two algorithms are presented, one for clustering a set of interconnected nodes and the other for forming a linear placement of clustered interconnected nodes, designed to analyze the structure of digital logic for automatic placement of logic functions on a MOS/LSI chip.
Design Automation ConferenceSHARPS: A Hierarchical Layout System for VLSI
31 Citations1981Toru Chiba, Noboru Okuda +4 more