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.
- 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 Scholar
- 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 Scholar
Digital Library
- Cormen, T., Leiserson, C., and Rivest, R. 1990. Introduction to Algorithms. The MIT Press. Google Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- Katajainen, J., Pasanen, T., and Teuhola, J. 1996. Practical in-place mergesort. Nordic J. Comput. 3, 1, 27--40. Google Scholar
Digital Library
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- Xilinx. 2003. Two flows for partial reconfiguration: Module based or difference based. Xilinx Application Note 290.Google Scholar
- Xilinx. 2007. Early access partial reconfiguration user guide. User Guide UG208.Google Scholar
Index Terms
Configuration Merging in Point-to-Point Networks for Module-Based FPGA Reconfiguration
Recommendations
The Effectiveness of Configuration Merging in Point-to-Point Networks for Module-based FPGA Reconfiguration
FCCM '08: Proceedings of the 2008 16th International Symposium on Field-Programmable Custom Computing MachinesCommunications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overheads incurred by a bus system or network-on-chip, the approach we have taken ...
An FPGA-based point pattern matching processor with application to fingerprint matching
CAMP '95: Proceedings of the Computer Architectures for Machine PerceptionWe describe the design and synthesis of a high-performance coprocessor for point pattern matching with application to fingerprint matching using Splash 2-an attached processor for SUN SPARCstation hosts. Each of the field programmable gate array (FPGA)-...
FPGA-Based Reconfigurable Hardware for Compute Intensive Data Mining Applications
3PGCIC '11: Proceedings of the 2011 International Conference on P2P, Parallel, Grid, Cloud and Internet ComputingAdvances in distributed system technology have enabled new computation paradigms such as Grid, Cloud, and Internet computing. Due to the logical and physical organization of these paradigms, portable and embedded computing devices are being developed ...






Comments