An investigation into statistical properties of partitioning and floorplanning problems

Authors:
S. Sastry;J.-I. Pi
Affiliations:
Dept. of EE-Systems, University of Southern California, Los Angeles, CA;Dept. of EE-Systems, University of Southern California, Los Angeles, CA
Venue:
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Year:
1989

Citing 4
Cited 0

A new algorithm for floorplan design

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
On the relation between wire length distributions and placement of logic on master slice ICs

DAC '84 Proceedings of the 21st Design Automation Conference
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Genetic algorithms as function optimizers

Genetic algorithms as function optimizers

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we examine some statistical properties exhibited by combinatorial optimization problems. Although the paper focuses on two particular problems that arise in chip design, namely circuit partitioning and floorplanning, the results seem valid for a much larger set of such problems. For the partitioning problem, we examine the solutions generated by the well known Kernighan-Lin procedure [5,10] and solutions generated by random search. We find that in both cases, the Type 3 (Weibull) extreme-value distribution provides an excellent model for the distribution of local minima generated. The location parameter of the Weibull provides an estimate of the minimum cost. For the floorplanning problem, we construct a number of test problems, whose optimal value is known. As with the partitioning problem, we find that the Weibull distribution provides an excellent model for estimating the minimum cost.