An orthogonal simulated annealing algorithm for large floorplanning problems

Authors:
Shinn-Ying Ho;Shinn-Jang Ho;Yi-Kuang Lin;William Cheng-Chung Chu
Affiliations:
Department of Biological Science and Technology and Institute of Bioinformatics, Nationsal Chiao Tung University, Hsin-Chu, Taiwan 300, R.O.C.;Department of Automation Engineering, National Huwei University of Science and Technology, Huwei, Yunlin, Taiwan 632, R.O.C.;Department of Information Engineering and Computer Science, Feng Chia University, Taichung, Taiwan 407, R.O.C.;Department of Computer Science and Information Engineering, TungHai University, Taichung, Taiwan 407, R.O.C.
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2004

Citing 8
Cited 4

Simulated annealing for VLSI design

Simulated annealing for VLSI design
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
Fast floorplanning for effective prediction and construction

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An orthogonal genetic algorithm with quantization for globalnumerical optimization

IEEE Transactions on Evolutionary Computation
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
VLSI/PCB placement with obstacles based on sequence pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Floorplanning using a tree representation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fast evaluation of sequence pair in block placement by longest common subsequence computation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Improved orthogonal array based simulated annealing for design optimization

Expert Systems with Applications: An International Journal
A Parallel Simulated Annealing Approach for Floorplanning in VLSI

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Intelligent particle swarm optimization in multi-objective problems

PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A hierarchical approach for incremental floorplan based on genetic algorithms

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conventional simulated annealing with some random generation mechanism using the sequence-pair topological representation in block placement and floorplanning is effective for a very small number of modules (40-50). This paper proposes an orthogonal simulated annealing algorithm (OSA) with an efficient generation mechanism (EGM) for solving large floorplanning problems. EGM samples a small number of representative floorplans and then efficiently derives a high-performance floorplan by using a systematic reasoning method for the next move of OSA based on orthogonal experimental design. Furthermore, an improved swap operation is proposed which cooperates with EGM to make OSA efficient. Excellent experimental results using the Microelectronics Center of North Carolina and the Gigascale Sysems Research Center benchmarks show that OSA performs better than existing methods for large floorplanning problems.