Fast placement approaches for FPGAs

Abstract

Recent trends in FPGA development indicate a strong shift toward design reuse through the use of intellectual property (IP). This design shift has motivated the development of Frontier, a timing-driven FPGA placement system that uses design macroblocks in conjunction with a series of placement algorithms to achieve highly routable and high-performance layouts quickly. In the first stage of design placement, a macro-based floorplanner is used to quickly identify an initial layout based on intermacro connectivity. Next, FPGA routability and performance metrics are used to evaluate the quality of the initial placement. Finally, if the floorplan is determined to be insufficient from a routability or performance standpoint, a feedback-driven placement perturbation step is employed to achieve a lower cost placement. For a collection of large reconfigurable computing benchmark circuits our timing-driven placement system exhibits a 2.6× speedup in combined place and route time versus commercial FPGA CAD software with improved design performance for most designs. It is shown that floorplanning, placement evaluation, and backend optimization are all necessary to achieve high-performance placement solutions.

References

1. Babb, J., Frank, M., Lee, V., Waingold, E., and Barua, R. 1997. The RAW benchmark suite: Computation structures for general purpose computing. In Proceedings of the IEEE Workshop on FPGA-Based Custom Computing Machines (Napa, Calif., April), 161--171.
2. Betz, V. and Rose, J. 1997. VPR: A new packing, placement, and routing tool for FPGA research. In Proceedings of the International Workshop on Field Programmable Logic and Applications (Oxford, UK, Sept.), 213--222.
3. Callahan, T., Chong, P., Dehon, A., and Wawrzynek, J. 1998. Fast module mapping and placement for datapaths in FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 123--132.
4. Emmert, J. and Bhatia, D. 1999. A methodology for fast FPGA floorplanning. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 47--56.
5. Emmert, J., Randhar, A., and Bhatia, D. 1998. Fast floorplanning for FPGAs. In Proceedings of the International Workshop on Field Programmable Logic and Applications (FPL'98) (Tallinn, Estonia, Sept.).
6. Gehring, S. and Ludwig, S. 1998. Fast integrated tools for circuit design with FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 133--139.
7. Koch, A. 1996. Structured design implementation---A strategy for implementing regular datapaths on FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 151--157.
8. Landman, B. and Russo, R. 1971. On a pin versus block relationship for partitions of logic graphs. IEEE Trans. Comput. C-20, 12 (Dec.), 1469--1479.
9. Lucent Technologies. 1996. Field-Programmable Gate Arrays Data Book. Lucent Technologies.
10. Marquardt, A., Betz, V., and Rose, J. 2000. Timing-driven placement for FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 203--213.
11. Sankar, Y. and Rose, J. 1999. Trading quality for compile time: Ultra-fast placement for FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 157--166.
12. Sechen, C. 1988. VLSI Placement and Global Routing Using Simulated Annealing. Kluwer, Boston.
13. Shahookar, K. and Mazumder, P. 1991. VLSI cell placement techniques. ACM Comput. Surv. 23, 2 (June), 145--220.
14. Sherwani, N. 1992. Algorithms for Physical Design Automation. Kluwer, Boston.
15. Swartz, J., Betz, V., and Rose, J. 1998. A fast routability-driven router for FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (Monterey, Calif., Feb.), 140--149.
16. Tessier, R. 1998. Fast place and route approaches for FPGAs. PhD Thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science. Also available as MIT LCS TR-768.
17. Trimberger, S. 1994. Field-Programmable Gate Array Technology. Kluwer, Boston.
18. Xilinx Corporation. 1998. The Programmable Logic Data Book. Xilinx Corporation.
19. Xilinx Corporation. 2001. Virtex II Data Sheet. Xilinx Corporation.
20. Yamanouchi, T., Tamakashi, K., and Kambe, T. 1996. Hybrid floorplanning based on partial clustering and module restructuring. In Proceedings of the IEEE International Conference on Computer-Aided Design (Nov.), 478--483.

Index Terms

• Applied computing

  • Physical sciences and engineering

    • Engineering

• Hardware

  • Electronic design automation

    • Physical design (EDA)

      • Placement

      • Wire routing

  • Very large scale integration design

    • Application-specific VLSI designs