Optimizing simulated annealing on GPU: A case study with IC floorplanning

Yiding Han, S. Roy, K. Chakraborty
Electr. & Comput. Eng., Utah State Univ., Logan, UT, USA
12th International Symposium on Quality Electronic Design (ISQED), 2011


   title={Optimizing simulated annealing on GPU: A case study with IC floorplanning},

   author={Han, Y. and Roy, S. and Chakraborty, K.},

   booktitle={Quality Electronic Design (ISQED), 2011 12th International Symposium on},





Source Source   



In this paper, we propose a novel floorplanning algorithm based on simulated annealing on GPUs. Simulated annealing is an inherently sequential algorithm, far from the typical programs suitable for Single Instruction Multiple Data (SIMD) style concurrency in a GPU. We propose a fundamentally different approach of exploring the floorplan solution space, where we evaluate concurrent moves on a given floorplan. We illustrate several performance optimization techniques for this algorithm on GPUs. Compared to the sequential algorithm, our techniques achieve 6-160X speedup for a range of MCNC and GSRC benchmarks, while delivering comparable or better solution quality.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: