Efficient simulated annealing-based placement algorithm for Island style FPGAs

Runxiao Shi, Lan Ma, Takahiro Watanabe

Research output: Contribution to journalArticle

Abstract

This paper proposes a group-based very fast simulated annealing (GB-VFSA) algorithm to achieve higher-quality placement in a shorter CPU time. We first introduce a temperature-dependent perturbation model based on Cauchy distribution to generate new solutions. Then, we put high-connected blocks into one group and use a group as a unit for placement. In order to avoid premature convergence of the algorithm, multiple potential solutions are used to search the solution space at the same time. The idea "pheromone" which comes from ant colony optimization is used to realize the communication between multiple potential solutions. Experimental results using MCNC beachmarks show that GB-VFSA achieved 23% reduction in CPU time and 3.6% improvement in maximal time delay over traditional simulating annealing algorithm.

Original languageEnglish
Pages (from-to)542-548
Number of pages7
JournalInternational Journal of Machine Learning and Computing
Volume8
Issue number6
DOIs
Publication statusPublished - 2018 Dec 1

Keywords

  • Block group
  • Island style FPGAs
  • Placement
  • Potential solution group
  • Simulating annealing

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Efficient simulated annealing-based placement algorithm for Island style FPGAs'. Together they form a unique fingerprint.

  • Cite this