skip to main content
research-article

Dynamic Defragmentation of Reconfigurable Devices

Published:01 June 2012Publication History
Skip Abstract Section

Abstract

We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs. Our method is based on dynamic relocation of module positions during runtime, with only very little reconfiguration overhead; the objective is to maximize the length of contiguous free space that is available for new modules. We describe a number of algorithmic aspects of good defragmentation, and present an optimization method based on tabu search. Experimental results indicate that we can improve the quality of module layout by roughly 50% over the static layout. Among other benefits, this improvement avoids unnecessary rejections of modules.

References

  1. Becker, T., Luk, W., and Cheung, P. Y. 2007. Enhancing relocatability of partial bitstreams for run-time reconfiguration. In Proceedings of the 15th Annual Symposium on Field Programmable Custom Computing Machines. 35--44. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Behnen, K. and Neuhaus, G. 1995. Grundkurs Stochastik 3rd Ed. B. G. Teubner-Verlag.Google ScholarGoogle Scholar
  3. Bender, M. A., Demaine, E. D., and Farach-Colton, M. 2005a. Cache-Oblivious B-trees. SIAM J. Comput. 35, 341--358. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bender, M. A., Fineman, J. T., Gilbert, S., and Kuszmaul, B. C. 2005b. Concurrent cache-oblivious B-trees. In Proceedings of the 17th Annual ACM Symposium on Parallel Algorithm Architecture. 228--237. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bromley, G. 1980. Memory fragmentation in buddy methods for dynamic storage allocation. Acta Inf. 14, 107--117.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Compton, K., Li, Z., Cooley, J., Knol, S., and Hauck, S. 2002. Configuration relocation and defragmentation for run-time reconfigurable systems. IEEE Trans. VLSI 10, 209--220. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Fekete, S. P., Kamphans, T., Schweer, N., Tessars, C., van der Veen, J. C., Angermeier, J., Koch, D., and Teich, J. 2008. No-Break dynamic defragmentation of reconfigurable devices. In Proceedings of the International Conference on Field Programmable Logic and Applications. 113--118.Google ScholarGoogle Scholar
  8. Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Gericota, M. G., Alves, G. R., Silva, M. L., and Ferreira, J. M. 2005. Run-Time defragmentation for dynamically reconfigurable hardware. In New Algorithms, Architectures and Applications for Reconfigurable Computing.Google ScholarGoogle Scholar
  10. Hinds, J. A. 1975. An algorithm for locating adjacent storage blocks in the buddy system. Comm. ACM 18, 221--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Hirschberg, D. S. 1973. A class of dynamic memory allocation algorithms. Comm. ACM 16, 615--618. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Knowlton, K. C. 1965. A fast storage allocator. Comm. ACM 8, 623--625. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Knuth, D. E. 1997. The Art of Computer Programming: Fundamental Algorithms 3rd Ed. Vol. 1. Addison-Wesley, Reading, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Koch, D., Ahmadinia, A., Bobda, C., and Kalte, H. 2004. FPGA architecture extensions for preemptive multitasking and hardware defragmentation. In Proceedings of the IEEE International Conference on Field Programmable Technology. 433--436.Google ScholarGoogle Scholar
  15. Koch, D., Haubelt, C., and Teich, J. 2007. Efficient hardware checkpointing: Concepts, overhead analysis, and implementation. In Proceedings of the 15th ACM/SIGDA International Symposium on Field Programmable Gate Arrays. ACM Press, New York, 188--196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Koch, D., Beckhoff, C., and Teich, J. 2008a. ReCoBusBuilder: A novel tool and technique to build static and dynamically reconfigurable systems for fpgas. In Proceedings of the 18th International Conference on Field Programmable Logic and Applications. 119--124.Google ScholarGoogle Scholar
  17. Koch, D., Haubelt, C., and Teich, J. 2008b. Efficient reconfigurable on-chip buses for fpgas. In Proceedings of the 16th Annual IEEE Symposium on Field Programmable Custom Computing Machines. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Koester, M., Kalte, H., Porrmann, M., and Ruckert, U. 2007. Defragmentation algorithms for partially reconfigurable hardware. Int. Fed. Inf. Proc. Publ. 240, 41.Google ScholarGoogle Scholar
  19. Kuon, I. and Rose, J. 2007. Measuring the gap between fpgas and asics. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 26, 203--215. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Lysaght, P., Blodget, B., Mason, J., Young, J., and Bridgford, B. 2006. Invited paper: Enhanced architecture, design methodologies and CAD tools for dynamic reconfiguration of Xilinx fpgas. In Proceedings of the 16th International Conference on Field Programmable Logic and Applications. 1--6.Google ScholarGoogle Scholar
  21. Shen, K. K. and Peterson, J. L. 1974. A weighted buddy method for dynamic storage allocation. Comm. ACM 17, 558--562. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Wilson, P. R., Johnstone, M. S., Neely, M., and Boles, D. 1995. Dynamic storage allocation: A survey and critical review. In Proceedings of the International Workshop on Memory Management, H. Baker Ed. Lecture Notes in Computer Science, vol. 986. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dynamic Defragmentation of Reconfigurable Devices

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!