Abstract
Dynamically reconfigurable FPGAs (DRFPGAs) have high logic utilization because of time-multiplexed interconnects and logic. In this article, we propose a performance-oriented algorithm for the DRFPGA partitioning problem. This algorithm partitions a given circuit system into stages such that the upper bound of the execution times of subcircuits is minimized. The communication cost is taken into consideration in the process of searching for the optimal solution. A graph is first constructed to represent the precedence constraints and calculate the number of buffers needed in a partitioning. This algorithm includes three phases. The first phase reduces the problem size by clustering the gates into subsystems that have only one output. Such a subsystem has a large number of intraconnections because the fan-outs of all vertices except for the one output are fed to the vertices inside the subsystem. This phase significantly reduces the computational complexity of partitioning. The second phase finds a partition with optimal performance. Finally, the third phase minimizes the communication cost by using an iterative improvement approach. Experimental results based on the Xilinx architecture show that our algorithm yields better partitioning solutions than traditional approaches.
- Bhat, N. B., Chaudhary, K., and Kuh, E. S. 1993. Performance-Oriented fully routable dynamic architecture for a field programmable logic device. Tech. rep. UCB/RELM93/42, University of California, Berkeley. Google Scholar
Digital Library
- Brown, J., Chen, D., Eslick, I., Tau, E., and DeHon, A. 1995. DELTA: Prototype for a First-Generation Dynamically Programmable Gate Array. MIT Press, Cambridge, MA.Google Scholar
- Chang, D. and Marek-Sadowska, M. 1997. Buffer minimization and time-multiplexed I/O on dynamically reconfigurable FPGAs. In Proceedings of the ACM International Symposium on Field Programmable Gate Arrays. 142--148. Google Scholar
Digital Library
- Chang, D. and Marek-Sadowska, M. 1999. Partitioning sequential circuits on dynamically reconfigurable FPGAs. IEEE Trans. Comput. 48, 6, 565--578. Google Scholar
Digital Library
- Chao, M. C. T., Wu, G. M., Jiang, I. H. R., and Chang, Y. W. 1999. A clustering- and probability-based approach for time-multiplexed FPGA partitioning. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 364--368. Google Scholar
Digital Library
- Chiu, G. R., Singh, D. P., Manohararajah, V., and Brown, S. D. 2006. Mapping arbitrary logic functions into synchronous embedded memories for area reduction on FPGAs. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 135--142. Google Scholar
Digital Library
- Cong, J. and Ding, Y. 1994. On area/depth tradeoff in LUT-based FPGA technology mapping. IEEE Trans. VLSI Syst. 2, 2, 137--148. Google Scholar
Digital Library
- Cong, J., Zheng, L., and Bagrodia, R. 1994. Acyclic multi-way partitioning of Boolean networks. In Proceedings of the 31st Annual Conference on Design Automation. 670--675. 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
- Fujii, T., Furuta, K.-I., Motomura, M., Nomura, M., Mizuno, M., Anjo, K.-I., Wakabayashi, K., Hirota, Y., Nakazawa, Y.-E., Ito, H., and Yamashina, M. 1999. A dynamically reconfigurable logic engine with a multi-context/multi-mode unified-cell architecture. In Proceedings of the IEEE International Solid-State Circuits Conference. 364--365.Google Scholar
- Jones, D. and Lewis, D. M. 1995. A time-multiplexed FPGA architecture for logic emulation. In Proceedings of the IEEE Custom Integrated Circuits Conference. 495--498.Google Scholar
- Kao, C. C. and Lai, Y. T. 2005. An efficient algorithm for finding the minimal-area FPGA technology mapping. ACM Trans. Des. Autom. Electron. Syst. 10, 1, 168--186. Google Scholar
Digital Library
- Liu, H., and Wong, D. F. 1998. Network flow based circuit partitioning for time-multiplexed FPGAs. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 497--504. Google Scholar
Digital Library
- Mak, W. K. and Young, E. F. Y. 2003. Temporal logic replication for dynamically reconfigurable FPGA partitioning. IEEE Trans. Comput.-Aid. Des. Integ. Circ. Syst. 22, 7, 952--959. Google Scholar
Digital Library
- Pareek, N. K., Patidar, V., and Sud, K. K. 2006. Image encryption using chaotic logistic map. Image Vis. Comput. 24, 926--934.Google Scholar
Cross Ref
- Trimberger, S. 1998. Scheduling designs into a time-multiplexed FPGA. In Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays. 153--160. Google Scholar
Digital Library
- Trimberger, S., Carberry, D., Johnson, A., and Wong, J. 1997. A time-multiplexed FPGA. In Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines. 22--28. Google Scholar
Digital Library
- Wong, E. S. H., Young, E. F. Y., and Mak, W. K. 2003. Clustering based acyclic multi-way partitioning. In Proceedings of the ACM Great Lakes Symposium on VLSI. 203--206. Google Scholar
Digital Library
- Wu, G. M., Lin, J. M., and Chang, Y. W. 2001. Generic ILP-based approaches for time-multiplexed FPGA partitioning. IEEE Trans. Comput.-Aid. Des. Integ. Circ. Syst. 20, 10, 1266--1274. Google Scholar
Digital Library
Index Terms
A Performance-Oriented Algorithm with Consideration on Communication Cost for Dynamically Reconfigurable FPGA Partitioning
Recommendations
Power minimization for dynamically reconfigurable FPGA partitioning
Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systemsDynamically reconfigurable FPGA (DRFPGA) implements a given circuit system by partitioning it into stages and then executing each stage sequentially. Traditionally, the number of communication buffers is minimized. In this article, we study the ...
Partitioning Sequential Circuits on Dynamically Reconfigurable FPGAs
A fundamental feature of Dynamically Reconfigurable FPGAs (DRFPGAs) is that the logic and interconnect are time-multiplexed. Thus, for a circuit to be implemented on a DRFPGA, it needs to be partitioned such that each subcircuit can be executed at a ...
Partitioning signal processing applications to different granularity reconfigurable logic
SSIP'05: Proceedings of the 5th WSEAS international conference on Signal, speech and image processingIn this paper, we propose a methodology for partitioning DSP applications between the fine and coarse-grain reconfigurable hardware for improving performance. The fine-grain logic is implemented by an embedded FPGA unit, while for the coarse-grain ...






Comments