Abstract
Fragmentation on dynamically reconfigurable FPGAs is a major obstacle to the efficient management of the logic space in reconfigurable systems. When resource allocation decisions have to be made at run-time a rearrangement may be necessary to release enough contiguous resources to implement incoming functions. The feasibility of run-time relocation depends on the processing time required to set up rearrangements. Moreover, the performance of the relocated functions should not be affected by this process or otherwise the whole system performance, and even its operation, may be at risk.
Relocation should take into account not only specific functional issues, but also the FPGA architecture, since these two aspects are normally intertwined. A simple and fast method to assess performance degradation of a function during relocation and to speed up the defragmentation process, based on previous function labelling and on the application of the Euclidian distance concept, is proposed in this paper.
This work is supported by an FCT program under contract POSC/EEA-ESE/55680/2004.
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
Ling, X.-P., Amano, H.: WASMII: a Data Driven Computer on a Virtual Hardware. In: Proc. 1st IEEE Workshop on FPGAs for Custom Computing Machines, pp. 33–42 (1993)
Gericota, M.G., Alves, G.R., Silva, M.L., Ferreira, J.M.: Run-Time Defragmentation for Dynamically Reconfigurable Hardware. In: New Algorithms, Architectures and Applications for Reconfigurable Computing, pp. 117–129. Springer, Heidelberg (2005)
Teich, J., Fekete, S., Schepers, J.: Compile-time optimization of dynamic hardware reconfigurations. In: Proc. Intl. Conf. on Parallel and Distributed Processing Techniques and Applications, pp. 1097–1103 (1999)
Handa, M., Vemuri, R.: An efficient algorithm for finding empty space for online FPGA placement. In: Proc. Design, Automation Conf., pp. 960–965 (2004)
Vinh, P.C., Bowen, J.P.: Continuity Aspects of Embedded Reconfigurable Computing. Innovations in Systems and Software Engineering: A NASA Journal 1(1), 41–53 (2005)
Ejnioui, A., DeMara, R.F.: Area Reclamation Strategies and Metrics for SRAM-Based Reconfigurable Devices, In: Proc. Intl. Conf. on Engineering of Reconfigurable Systems and Algorithms (2005)
Politécnico di Torino ITC 1999 benchmarks, Available at: http://www.cad.polito.it/tools/itc99.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gericota, M.G., Alves, G.R., Lemos, L.F., Ferreira, J.M. (2006). A New Approach to Assess Defragmentation Strategies in Dynamically Reconfigurable FPGAs. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds) Reconfigurable Computing: Architectures and Applications. ARC 2006. Lecture Notes in Computer Science, vol 3985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802839_34
Download citation
DOI: https://doi.org/10.1007/11802839_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36708-6
Online ISBN: 978-3-540-36863-2
eBook Packages: Computer ScienceComputer Science (R0)