Abstract
The aim of this article is to describe a complete partitioning and floorplanning algorithm tailored for reconfigurable architectures deployable on FPGAs and considering communication infrastructure feasibility. This article proposes a novel approach for resource- and reconfiguration- aware floorplanning. Different from existing approaches, our floorplanning algorithm takes specific physical constraints such as resource distribution and the granularity of reconfiguration possible for a given FPGA device into account. Due to the introduction of constraints typical of other problems like partitioning and placement, the proposed approach is named floorplacer in order to underline the great differences with respect to traditional floorplanners. These physical constraints are typically considered at the later placement stage. Different aspects of the problems have been described, focusing particularly on the FPGAs resource heterogeneity and the temporal dimension typical of reconfigurable systems. Once the problem is introduced a comparison among related works has been provided and their limits have been pointed out. Experimental results proved the validity of the proposed approach.
- Adya, S., Chaturvedi, S., Roy, J., Papa, D., and Markov, I. 2004. Unification of partitioning, placement and floorplanning. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 550--557. Google Scholar
Digital Library
- Adya, S. and Markov, I. 2003. Fixed-outline floorplanning: enabling hierarchical design. IEEE Trans. VLSI Syst. 11, 6, 1120--1135. Google Scholar
Digital Library
- Bazargan, K., Kastner, R., and Sarrafzadeh, M. 1999. 3-d floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems. In Proceedings of the IEEE International Workshop on Rapid System Prototyping. 38. Google Scholar
Digital Library
- Corbetta, S., Ferrandi, F., Morandi, M., Novati, M., Santambrogio, M., and Sciuto, D. 2007. Two novel approaches to online partial bitstream relocation in a dynamically reconfigurable system. In Proceedings of the IEEE International Symposium on VLSI. 457--458. Google Scholar
Digital Library
- Donato, A., Ferrandi, F., Redaelli, M., Santambrogio, M. D., and Sciuto, D. 2007. Exploiting partial dynamic reconfiguration for SOC design of complex application on FPGA platforms. In VLSI-SOC: From Systems to Silicon. 87--109.Google Scholar
- Fekete, S. P., Kohler, E., and Teich, J. 2001. Optimal FPGA module placement with temporal precedence constraints. In Proceedings of Design, Automation and Test in Europe Conference. 658--665. Google Scholar
Digital Library
- Feng, Y. and Mehta, D. P. 2006. Heterogeneous floorplanning for FPGAs. In Proceedings of the IEEE International Conference on VLSI Design. 257--262. Google Scholar
Digital Library
- Gupta, R. 1995. Co-Synthesis of Hardware and Software for Digital Embedded Systems. Springer. Google Scholar
Digital Library
- IBM Microelectronics 1999. CoreConnect(TM) bus architecture. IBM Microelectronics.Google Scholar
- Kalte, H., Lee, G., Porrmann, M., and Ruckert, U. 2005. Replica: A bitstream manipulation filter for module relocation in partial reconfigurable systems. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium. 151b. Google Scholar
Digital Library
- Murata, H., Fujiyoshi, K., Nakatake, S., and Kajitani, Y. 1996. VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans. Comput.-Aid. Des. Integ. Circ. Syst. 15, 12, 1518--1524. Google Scholar
Digital Library
- Roy, J., Adya, S., Papa, D., and Markov, I. 2006. Min-cut floorplacement. IEEE Trans. Comput.-Aid. Des. Integ. Circ. Syst. 25, 7, 1313--1326. Google Scholar
Digital Library
- Sait, S. and Youssef, H. 1999. VLSI Physical Design Automation. World Scientific Publishing Company. Google Scholar
Digital Library
- Singhal, L. and Bozorgzadeh, E. 2006. Multi-layer floorplanning on a sequence of reconfigurable designs. In Proceedings of the IEEE International Conference on Field Programmable Logic and Applications. 1--8.Google Scholar
- Stankovic, J. 1996. Strategic directions in real-time and embedded systems. ACM Comput. Surv. 28, 4, 751--763. Google Scholar
Digital Library
- Vasilko, M. 1999. Dynasty: A temporal floorplanning based cad framework for dynamically reconfigurable logic systems. In Proceedings of the 9th International Workshop on Field-Programmable Logic and Applications. Springer-Verlag, Berlin, Germany. 124--133. Google Scholar
Digital Library
- Xilinx Inc. 2002. MicroBlaze hardware reference guide. Xilinx Inc.Google Scholar
- Xilinx Inc. 2006. Early access partial reconfiguration user guide. Xilinx Incorporation.Google Scholar
- Xilinx Inc. 2007c. Xilinx application note 290. Xilinx Incorporation.Google Scholar
- Xilinx Inc. 2007a. Virtex 5 - family overview. Xilinx Incorporation.Google Scholar
- Xilinx Inc. 2007b. Virtex II - family overview. Xilinx Incorporation.Google Scholar
- Yuh, P.-H., Yang, C.-L., and Chang, Y.-W. 2007. Temporal floorplanning using the three-dimensional transitive closure subgraph. ACM Trans. Des. Automat. Elect. Syst. 12, 4, 37. Google Scholar
Digital Library
- Yuh, P.-H., Yang, C.-L., and Chang, Y.-W. 2004. Temporal floorplanning using the t-tree formulation. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 300--305. Google Scholar
Digital Library
Index Terms
Placement and Floorplanning in Dynamically Reconfigurable FPGAs
Recommendations
An Effective Timing-Driven Detailed Placement Algorithm for FPGAs
ISPD '17: Proceedings of the 2017 ACM on International Symposium on Physical DesignIn this paper, we propose a new timing-driven detailed placement technique for FPGAs based on optimizing critical paths. Our approach extends well beyond the previously known critical path optimization approaches and explores a significantly larger ...
BoxPlacer: Force Directed-Based Timing-Driven Placement for Large-Scale FPGAs: (Abstract Only)
FPGA '18: Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate ArraysPlacement is probably the most critical process in the FPGA design flow. The demand for high performance continues to increase, but existing placers are still faced with numerous challenges including very long runtime, poor scalability, and restricted ...






Comments