Performance of algorithms for initial placement

Authors:
Michael Palczewski
Affiliations:
Solomon Design Automation Corp., 2461 College Blvd, Santa Clara, CA
Venue:
DAC '84 Proceedings of the 21st Design Automation Conference
Year:
1984

Citing 5
Cited 2

Principles of artificial intelligence

Principles of artificial intelligence
Handbook of AI

Handbook of AI
The genealogical approach to the layout problem

DAC '80 Proceedings of the 17th Design Automation Conference
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

VLSI cell placement techniques

ACM Computing Surveys (CSUR)
Automatic placement a review of current techniques (tutorial session)

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes the performance of a commonly used class of methods for initial placement and describes several new classes. The classification in this paper is based on common methods of problem-solving used in artificial intelligence (AI) approaches. The paper does not describe the details of algorithms; instead it focuses on the qualitative performance.