Optimization by simulated evolution with applications to standard cell placement

Authors:
Ralph-Michael Kling;Prithviraj Banerjee
Affiliations:
Center for Reliable and High-Performance Computing, University of Illinois at Urbana-Champaign, 1101 W. Springfield Ave., Urbana, IL;Center for Reliable and High-Performance Computing, University of Illinois at Urbana-Champaign, 1101 W. Springfield Ave., Urbana, IL
Venue:
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Year:
1991

Citing 3
Cited 7

ESP: a new standard cell placement package using simulated evolution

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
An evolution-based approach to partitioning ASIC systems

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Proud: a fast sea-of-gates placement algorithm

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference

Incremental physical design

ISPD '00 Proceedings of the 2000 international symposium on Physical design
An adaptive partitioning algorithm for distributed discrete event simulation systems

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Evolutionary algorithms for the physical design of VLSI circuits

Advances in evolutionary computing
Reducing null messages overhead through load balancing in conservative distributed simulation systems

Journal of Parallel and Distributed Computing
A new fuzzy operator and its application to topology design of distributed local area networks

Information Sciences: an International Journal
A genetic algorithm for channel routing in vlsi circuits

Evolutionary Computation
Automatic placement of micropipeline standard cells

WSEAS Transactions on Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a mathematical formulation of the Simulated Evolution algorithm, a novel optimization technique, followed by a thorough analysis of the associated Markovchain model. We show that the algorithm will reach a global minimum with probability one, and also introduce a novel hierarchical placement technique. Finally, we describe a Standard Cell placement program based on the new approach whose preliminary results are comparable to the best Simulated Annealing algorithms.