Static Profile-Driven Compilation for FPGAs

  • Srihari Cadambi
  • Seth Copen Goldstein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2147)


We describe a static profiling methodology to extract hot-spots from netlists. Hot-spots are small regular sub-circuits the optimization of which has a big impact on the final result. We have built a tool that can extract and characterize hot-spots from large netlists very quickly. The tool can be used to direct human attention on portions of circuits that need hand-optimization, as well as to automatically direct efforts of FPGA tools. We show impressive throughput improvements when compiling to the PipeRench reconfigurable architecture and use hot-spots to enable fast architectural design space exploration for FPGAs by predicting the FPGA CLB structure that produces the best final area-delay. Our prediction is fairly accurate and only takes a few hours as compared to weeks for an exhaustive analysis. We also demonstrate better results when targeting FPGAs with heterogeneous CLBs.


Field Programmable Gate Array Good Cluster Pipeline Stage Heterogeneous Cluster Human Attention 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Srihari Cadambi, Seth Copen Goldstein: CPR: A Configuration Profiling Tool. IEEE Symposium on FPGAs for Custom Computing Machines (1999) 104–113.Google Scholar
  2. 2.
    S C Goldstein, H Schmit, M Moe, M Budiu, S Cadambi, R Laufer, R Taylor: PipeRench: A Coprocessor for Streaming Multimedia Acceleration. 26th Annual Internation Symposium on Computer Architecture (1999) 28–39.Google Scholar
  3. 3.
    Mihai-Dan Budiu, Seth Copen Goldstein: Fast Compilation for Pipelined Reconfigurable Fabrics. Proc. ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays.Google Scholar
  4. 4.
    S Cadambi, J Weener, S C Goldstein, H Schmit, D E Thomas: Managing pipeline-reconfigurable FPGAs. Proc. ACM/SIGDA Sixth International Symposium on Field Programmable Gate Arrays (1998).Google Scholar
  5. 5.
    Alexander (Sandy) Marquardt, V Betz, J Rose: Speed and Area Trade-offs in Cluster-Based FPGA Architectures. IEEE Tran. on VLSI Systems (2000) 84–93.Google Scholar
  6. 6.
    M Hutton, J P Grossman, J Rose, D Corneil: Characterization and Parameterized Random Generation of Digital Circuits. Proc. 33rd ACM/SIGDA Design Automation Conference (1996).Google Scholar
  7. 7.
    R K Brayton, R Rudell, A Sangiovanni-Vincentelli, A R Wang: MIS: A Multiple-level Logic Optimization System. IEEE Tran. on CAD (1987) 1062–1081.Google Scholar
  8. 8.
    Jason Cong, Yuzheng Ding: FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs. IEEE Transactions on CAD (1994) 1–12.Google Scholar
  9. 9.
    V Betz, J Rose: VPR: A New Packing, Placement and Routing Tool for FPGA Research. Proc. International Workshop on Field Programmable Logic and Applications (1997).Google Scholar
  10. 10.
    D S Rao, F J Kurdahi: On Clustering for Maximal Regularity Extraction. IEEE Trans. on CAD 12,8 (1983) 1198–1208.Google Scholar
  11. 11.
    S R Arikati, R Varadarajan: A Signature-Based Approach to Regularity Extraction. Proc. Int’l Conf. on CAD (1997) 542–545.Google Scholar
  12. 12.
    Amit Chowdhary, Sudhakar Kale, Phani Saripella, Naresh Sehgal, Rajesh Gupta: A General Approach for Regularity Extraction in Datapath Circuits. Proc. Int’l Conf. on CAD (1998).Google Scholar
  13. 13.
    Thomas Kutzchebauch, Leon Stok: Regularity Driven Logic Synthesis. Proc. Int’l Conf. on CAD (2000).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Srihari Cadambi
    • 1
  • Seth Copen Goldstein
    • 2
  1. 1.C&C Research LaboratoriesNEC USAPrincetonUSA
  2. 2.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations