Abstract
Run-time reconfiguration (RTR) of FPGAs is mainly done using the configuration interface. However, for a certain group of designs, RTR using the shift register functionality of the LUTs is a much faster alternative than conventional RTR using the ICAP. This method requires the creation of reconfiguration chains connecting the run-time reconfigurable LUTs (SRL). In this paper, we develop and evaluate a method to generate these reconfiguration chains in an automated way so that their influence on the RTR design is minimised and the reconfiguration time is optimised. We do this by solving a constrained multiple travelling salesman problem (mTSP) based on the placement information of the run-time reconfigurable LUTs. An algorithm based on simulated annealing was developed to solve this new constrained mTSP. We show that using the proposed method, reconfiguration chains can be added with minimal influence on the clock frequency of the original design.
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.
Similar content being viewed by others
References
Bruneel, K., Heirman, W., Stroobandt, D.: Dynamic Data Folding with Parametrizable FPGA Configurations. ACM TODAES 16, 43:1–43:29 (2011)
Dynamic Constant Coefficient Multiplier v2.0. Xilinx (2000)
Abouelella, F., Bruneel, K., Stroobandt, D.: Towards a More Efficient Run-Time FPGA Configuration Generation. In: Proceedings of ParCo 2009, pp. 113–116 (2009)
Al Farisi, B., Bruneel, K., Devos, H., Stroobandt, D.: Automatic Tool Flow for Shift-Register-LUT Reconfiguration. In: Proceedings of the 18th Annual ACM/SIGDA International Symposium on Field Programmable Gate Arrays, p. 287 (2010)
Potvin, J., Lapalme, G., Rousseau, J.: A Generalized K-Opt Exchange Procedure for the mTSP. INFOR 27, 474–481 (1989)
Kobayashi, S., Edahiro, M., Kubo, M.: A VLSI Scan-Chain Optimization Algorithm for Multiple Scan-Paths. IEICE Trans. Fund. E82-A, 2499–2504 (1999)
Rahimi, K., Soma, M.: Layout Driven Synthesis of Multiple Scan Chains. IEEE TCAD 22, 317–326 (2003)
Song, C., Lee, K., Lee, W.D.: Extended Simulated Annealing for Augmented TSP and Multi-salesmen TSP. In: Proceedings of IJCNN 2003, vol. 3, pp. 2340–2343 (2003)
Kirkpatrick, S.: Optimization by Simulated Annealing: Quantitative Studies. Journal of Statistical Physics 34, 975–986 (1984)
Betz, V., Rose, J., Marquardt, A.: Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers, Norwell (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heyse, K., Farisi, B.A., Bruneel, K., Stroobandt, D. (2012). Automating Reconfiguration Chain Generation for SRL-Based Run-Time Reconfiguration. In: Choy, O.C.S., Cheung, R.C.C., Athanas, P., Sano, K. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2012. Lecture Notes in Computer Science, vol 7199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28365-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-28365-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28364-2
Online ISBN: 978-3-642-28365-9
eBook Packages: Computer ScienceComputer Science (R0)