An orthogonal simulated annealing algorithm for large floorplanning problems

@article{Ho2004AnOS,
  title={An orthogonal simulated annealing algorithm for large floorplanning problems},
  author={S. Ho and Shinn-Jang Ho and Y. Lin and W. Chu},
  journal={IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
  year={2004},
  volume={12},
  pages={874-877}
}
  • S. Ho, Shinn-Jang Ho, +1 author W. Chu
  • Published 2004
  • Computer Science
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Orthogonal Learning Particle Swarm Optimization
    • 307
    • Open Access
    Orthogonal Learning Particle Swarm Optimization
    • 250
    • Open Access
    Improved orthogonal array based simulated annealing for design optimization
    • 21
    • Highly Influenced
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES
    VLSI module placement based on rectangle-packing by the sequence-pair
    • 647
    • Highly Influential
    • Open Access
    An orthogonal genetic algorithm with quantization for global numerical optimization
    • 730
    • Open Access
    B*-trees: a new representation for non-slicing floorplans
    • 190
    Fast evaluation of sequence pair in block placement by longest common subsequence computation
    • 133
    • Highly Influential
    • Open Access
    VLSI/PCB placement with obstacles based on sequence-pair
    • 79
    • Open Access
    Simulated Annealing for VLSI Design
    • 216
    • Open Access
    Floorplanning using a tree representation
    • 93
    • Open Access
    Floorplan design of VLSI circuits
    • 33
    • Open Access
    Fast floorplanning for effective prediction and construction
    • 26
    • Open Access
    Mesh optimization for surface approximation using an efficient coarse-to-fine evolutionary algorithm
    • 22