Abstract
This work introduces three improvements to the traditional simulated annealing algorithm, which is widely used in industrial and academic tools for FPGA placement. The improved algorithm has been tested with the 20 largest benchmarks from the MCNC set and the results were compared with the VPR placer. The outcome is nearly 3% better timing and about 6% less swap moves in the kernel of the simulated annealing algorithm. The main positive result is the reduction of the run time of the simulated annealing algorithm without sacrificing the placement quality for combined routability and timing driven case. For most benchmarks, the quality of the final placement could even be improved despite using less swap moves.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Betz, V., Rose, J.: VPR: A New Packing, Placement and Routing Tool for FPGA Research. In: Glesner, M., Luk, W. (eds.) FPL 1997. LNCS, vol. 1304, pp. 213–222. Springer, Heidelberg (1997)
Cheng, C.E.: RISA: Accurate and Efficient Placement Routability Modeling. In: Proceedings of the 31st Design Automation Conference, pp. 690–695 (1994)
Lam, J., Delosme, J.: Performance of the New Annealing Schedule. In: Proceedings of the 35th Design Automation Conference, pp. 306–311 (1998)
Marquardt, A., Betz, V., Rose, J.: Timing-Driven Placement for FPGAs. In: Proceedings of the 8th ACM International Conference on Field-Programmable Gate-Arrays (FPGA 2000), Monterey, California (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Danilin, A., Sawitzki, S. (2004). Optimizing the Performance of the Simulated Annealing Based Placement Algorithms for Island-Style FPGAs. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_88
Download citation
DOI: https://doi.org/10.1007/978-3-540-30117-2_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22989-6
Online ISBN: 978-3-540-30117-2
eBook Packages: Springer Book Archive