Abstract
FPGA (Field Programmable Gate Arrays) placement consumes half of the runtime of the design flow. As the number of cells are increasing due to increase in design complexity and size, this problem is gaining importance. Typically placement of blocks in FPGA are based on simulated annealing algorithms. Since the FPGA designs are smaller compared with their ASIC counterparts, simulated annealing algorithms are feasible as the runtime to place them is less. However, as the design size and complexity is increasing, simulated annealing algorithms and genetic programming based algorithms tend to be slower. In this paper, our work is targetted towards improving the runtime of placement in FPGAs. We propose a novel algorithm which is based on nonlinear analytical methods. This method uses density penalty approach, wherein, the spreading of blocks across the die is controlled by the square of penalty for the uneven regions across the die. Our method is fast and, when compared with VPR, we improve the runtime by 750% while providing a reasonably good solution for the placement.
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
References
Betz, V., Rose, J.: VPR: a new packing, placement and routing tool for FPGA research. In: Luk, W., Cheung, P.Y.K., Glesner, M. (eds.) FPL 1997. LNCS, vol. 1304, pp. 213–222. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63465-7_226. http://dl.acm.org/citation.cfm?id=647924.738755
Bostelmann, T., Sawitzki, S.: Improving FPGA placement with a self-organizing map. In: 2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig), pp. 1–6 (2013). https://doi.org/10.1109/ReConFig.2013.6732302
Chan, T., Cong, J., Sze, K.: Multilevel generalized force-directed method for circuit placement. In: Proceedings of the 2005 International Symposium on Physical Design, ISPD 2005, pp. 185–192. ACM, New York (2005). http://doi.acm.org/10.1145/1055137.1055177
Chen, J., Zhu, W.: An analytical placer for VLSI standard cell placement. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 31(8), 1208–1221 (2012). https://doi.org/10.1109/TCAD.2012.2190289
Chen, T.C., Jiang, Z.W., Hsu, T.C., Chen, H.C., Chang, Y.W.: NTUplace3: an analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 27(7), 1228–1240 (2008). https://doi.org/10.1109/TCAD.2008.923063
Collier, R., Fobel, C., Richards, L., Grewal, G.: A formal and empirical analysis of recombination for genetic algorithm-based approaches to the FPGA placement problem. In: 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), pp. 1–6 (2012). https://doi.org/10.1109/CCECE.2012.6334856
Eisenmann, H., Johannes, F.: Generic global placement and floorplanning. In: Proceedings of Design Automation Conference, pp. 269–274 (1998)
Fobel, C., Grewal, G., Stacey, D.: GPU-accelerated wire-length estimation for FPGA placement. In: 2011 Symposium on Application Accelerators in High-Performance Computing, pp. 14–23 (2011). https://doi.org/10.1109/SAAHPC.2011.16
Fobel, C., Grwal, G., Collier, R., Stacey, D.: GPU approach to FPGA placement based on star+. In: 10th IEEE International NEWCAS Conference, pp. 229–232 (2012). https://doi.org/10.1109/NEWCAS.2012.6328998
Gharibian, F., Shannon, L., Jamieson, P.: Finding system-level information and analyzing its correlation to FPGA placement. In: 2010 International Conference on Field Programmable Logic and Applications, pp. 544–549 (2010). https://doi.org/10.1109/FPL.2010.107
Hill, D.: Method and system for high speed detailed placement of cells within an integrated circuit design. US Patent 6370673 (2002). http://www.google.com/patents/US6370673
Huang, B., Zhang, H.: Application of multi-core parallel computing in FPGA placement. In: 2013 2nd International Symposium on Instrumentation and Measurement, Sensor Network and Automation (IMSNA), pp. 884–889 (2013). https://doi.org/10.1109/IMSNA.2013.6743419
Jamieson, P., Gharibian, F., Shannon, L.: Supergenes in a genetic algorithm for heterogeneous FPGA placement. In: 2013 IEEE Congress on Evolutionary Computation, pp. 253–260 (2013). https://doi.org/10.1109/CEC.2013.6557578
Kahng, A.B., Wang, Q.: Implementation and extensibility of an analytic placer. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 24(5), 734–747 (2005). https://doi.org/10.1109/TCAD.2005.846366
Naylor, W.C., Donelly, R., Sha, L.: Non-linear optimization system and method for wire length and delay optimization for an automatic electric circuit placer. U.S. Patent 6301693(12) (2001)
Obermeier, B., Ranke, H., Johannes, F.M.: Kraftwerk: a versatile placement approach. In: ISPD 2005, pp. 242–244. ACM, New York (2005). http://doi.acm.org/10.1145/1055137.1055190
Pattison, R., Fobel, C., Grewal, G., Areibi, S.: Scalable analytic placement for FPGA on GPGPU. In: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig), pp. 1–6 (2015). https://doi.org/10.1109/ReConFig.2015.7393356
Versatile Placement Routing Tool: http://www.eecg.toronto.edu/~vaughn/vpr/vpr.html. Accessed 17 Jan 2017
Viswanathan, N., Chu, C.: Fastplace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 24(5), 722–733 (2005). https://doi.org/10.1109/TCAD.2005.846365
Wang, Y., Shin, H.: An effective window based legalization algorithm for FPGA placement. In: 2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig), pp. 1–4 (2013). https://doi.org/10.1109/ReConFig.2013.6732270
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Pawanekar, S., Trivedi, G. (2017). Fast FPGA Placement Using Analytical Optimization. In: Kaushik, B., Dasgupta, S., Singh, V. (eds) VLSI Design and Test. VDAT 2017. Communications in Computer and Information Science, vol 711. Springer, Singapore. https://doi.org/10.1007/978-981-10-7470-7_64
Download citation
DOI: https://doi.org/10.1007/978-981-10-7470-7_64
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7469-1
Online ISBN: 978-981-10-7470-7
eBook Packages: Computer ScienceComputer Science (R0)