Architecture-adaptive range limit windowing for simulated annealing FPGA placement

  title={Architecture-adaptive range limit windowing for simulated annealing FPGA placement},
  author={Ken Eguro and S. Hauck and Akshay Sharma},
  journal={Proceedings. 42nd Design Automation Conference, 2005.},
Previous research has shown both theoretically and practically that simulated annealing could greatly benefit from the incorporation of an adaptive range limiting window to control the acceptance ratio of swaps during placement. However, the implementation of such a system is not necessarily obvious. Existing range limiting techniques have several fundamental shortcomings when dealing with both standard island-style FPGAs and more exotic architectures. In this paper the authors discussed the… Expand
11 Citations
Enhanced placement algorithm for FPGAs using sparse circuit
Detailed placement for modern FPGAs using 2D dynamic programming
Improving FPGA Placement With Dynamically Adaptive Stochastic Tunneling
  • Mingjie Lin, J. Wawrzynek
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2010
Markov clustering based placement algorithm for island-style FPGAs
  • Hui Dai, Qiang Zhou, O. He, Jinian Bian
  • Computer Science
  • The 2010 International Conference on Green Circuits and Systems
  • 2010
GDP: GPU accelerated Detailed Placement
  • Shounak Dhar, D. Pan
  • Computer Science
  • 2018 IEEE High Performance extreme Computing Conference (HPEC)
  • 2018
RegPlace: A high quality open-source placement framework for structured ASICs
Causal Groupoid Symmetries and Big Data


Performance of a new annealing schedule
  • Jimmy Lam, J. Delosme
  • Computer Science
  • 25th ACM/IEEE, Design Automation Conference.Proceedings 1988.
  • 1988