skip to main content
research-article

Configuration Merging in Point-to-Point Networks for Module-Based FPGA Reconfiguration

Published:01 January 2010Publication History
Skip Abstract Section

Abstract

Partial runtime reconfiguration allows some circuit components to be reconfigured while the remaining circuitry continues to operate. Applications partitioned into modules have the potential to exploit this capability to virtualize hardware by swapping modules as required. One of the challenges in doing so is to provide a communication infrastructure that supports the interfaces and communication needs of a sequence of dynamic module swaps. In contrast to previous approaches which have examined the use of buses and networks-on-chip for this purpose, we examine the use of customized point-to-point wiring harnesses to provide the dynamic connections required for dynamic modular reconfiguration in an efficient manner. The COMMA methodology implements applications on tile-reconfigurable FPGAs, such as the Virtex-4, and its design flow is integrated with the early access partial reconfiguration tools from Xilinx. This article outlines the methodology and describes greedy and dynamic programming approaches to merging the communication graphs of successive configurations in order to generate effective wiring harnesses within the methodology. Our evaluation indicates merging can markedly reduce total reconfiguration delays at the cost of increased critical path delays. Application of the technique is likely to be limited to scenarios in which the execution time between reconfigurations is short.

References

  1. Bobda, C., Ahmadinia, A., Majer, M., Teich, J., Fekete, S., and Veen, J. 2005. DyNoC: A dynamic infrastructure for communication in dynamically reconfigurable devices. In Proceedings of the International Conference on Field Programmable Logic and Applications. 153--158.Google ScholarGoogle Scholar
  2. Brebner, G. 1997. The swappable logic unit: A paradigm for virtual hardware. In Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines. 77--86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Cormen, T., Leiserson, C., and Rivest, R. 1990. Introduction to Algorithms. The MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. DeHon, A. 1994. DPGA-coupled microprocessors: Commodity ICs for the early 21st Century. In Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines. 31--39.Google ScholarGoogle ScholarCross RefCross Ref
  5. Eldredge, J. and Hutchings, B. 1994. Density enhancement of a neural network using FPGAs and runtime reconfiguration. In Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines (FCCM’94). 180--188.Google ScholarGoogle Scholar
  6. Fekete, S., Köhler, E., and Teich, J. 2001. Optimal FPGA module placement with temporal precedence constraints. In Proceedings of the Design, Automation and Test in Europe. IEEE, 658--665. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Gajjala Purna, K. and Bhatia, D. 1999. Temporal partitioning and scheduling data flow graphs for reconfigurable computers. IEEE Trans. Comput. 48, 6, 579--590. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Hagemeyer, J., Kettelhoit, B., Köster, M., and Porrmann, M. 2007. A design methodology for communication infrastructures on partially reconfigurable FPGAs. In Proceedings of the International Conference on Field-Programmable Logic and Applications. IEEE, 331--338.Google ScholarGoogle Scholar
  9. Horta, E., Lockwood, J., Taylor, D., and Parlour, D. 2002. Dynamic hardware plugins in an FPGA with partial runtime reconfiguration. In Proceedings of the Design Automation Conference. 343--348. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Kalte, H., Porrmann, M., and Rückert, U. 2004. System-on-Programmable-Chip approach enabling online fine-grained 1D-placement. In Proceedings of the International Parallel and Distributed Processing Symposium. 141--148.Google ScholarGoogle Scholar
  11. Karypis, G. and Kumar, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 1, 359--392. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Katajainen, J., Pasanen, T., and Teuhola, J. 1996. Practical in-place mergesort. Nordic J. Comput. 3, 1, 27--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Koh, S. 2008. Generating the communications infrastructure for module-based dynamic reconfiguration of FPGAs. Ph.D. thesis, School of Computer Science and Engineering, The University of New South Wales.Google ScholarGoogle Scholar
  14. Koh, S. and Diessel, O. 2006a. COMMA: A communications methodology for dynamic module-based reconfiguration of FPGAs. In Proceedings of the International Conference on Architecture of Computing Systems, Dynamically Reconfigurable Systems Workshop. 173--182.Google ScholarGoogle Scholar
  15. Koh, S. and Diessel, O. 2006b. Communications infrastructure generation for modular FPGA reconfiguration. In Proceedings of the IEEE International Conference on Field Programmable Technology. IEEE, 321--324.Google ScholarGoogle Scholar
  16. Koh, S. and Diessel, O. 2007. Module graph merging and placement to reduce reconfiguration overheads in paged FPGA devices. In Proceedings of the International Conference on Field Programmable Logic and Applications. IEEE, 293--298.Google ScholarGoogle Scholar
  17. Koh, S. and Diessel, O. 2008. The effectiveness of configuration merging in point-to-point networks for module-based FPGA reconfiguration. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lou, J., Thakur, S., Krishnamoorthy, S., and Sheng, H. 2002. Estimating routing congestion using probabilistic analysis. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 21, 1, 32--41. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Majer, M., Teich, J., Ahmadinia, A., and Bobda, C. 2007. The Erlangen slot machine: A dynamically reconfigurable FPGA-based computer. J. VLSI Signal Process. 47, 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Manohararajah, V., Chiu, G., Singh, D., and Brown, S. 2006. Difficulty of predicting interconnect delay in a timing driven FPGA CAD flow. In Proceedings of the International Workshop on System-Level Interconnect Prediction. 3--8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Marescaux, T., Bartic, A., Verkest, D., Vernalde, S., and Lauwereins, R. 2002. Interconnection networks enable fine-grain dynamic multi-tasking on FPGAs. In Proceedings of the International Conference on Field-Programmable Logic and Applications. 741--763. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Roy, J., Papa, D., Adya, S., Chan, H., Ng, A., Lu, J., and Markov, I. 2005. Capo: Robust and scalable open-source min-cut floorplacer. In Proceedings of the International Symposium on Physical Design. IEEE, 224--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Ullmann, M., Hübner, M., Grimm, B., and Becker, J. 2004. On-Demand FPGA runtime system for dynamical reconfiguration with adaptive priorities. In Proceedings of the International Conference on Field Programmable Logic and Applications. Springer, 454--463.Google ScholarGoogle Scholar
  24. Villasenor, J., Jones, C., and Schoner, B. 1995. Video communications using rapidly reconfigurable hardware. IEEE Trans. Circ. Syst. Video Technol. 5, 6, 565--567. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Xilinx. 2003. Two flows for partial reconfiguration: Module based or difference based. Xilinx Application Note 290.Google ScholarGoogle Scholar
  26. Xilinx. 2007. Early access partial reconfiguration user guide. User Guide UG208.Google ScholarGoogle Scholar

Index Terms

  1. Configuration Merging in Point-to-Point Networks for Module-Based FPGA Reconfiguration

          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

          • Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0

            Other Metrics

          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!