skip to main content
research-article

Hierarchical Benchmark Circuit Generation for FPGA Architecture Evaluation

Published:01 August 2012Publication History
Skip Abstract Section

Abstract

We describe a stochastic circuit generator that can be used to automatically create benchmark circuits for use in FPGA architecture studies. The circuits consist of a hierarchy of interconnected modules, reflecting the structure of circuits designed using a system-on-chip design flow. Within each level of hierarchy, modules can be connected in a bus, star, or dataflow configuration. Our circuit generator is calibrated based on a careful study of existing system-on-chip circuits. We show that our benchmark circuits lead to more realistic architectural conclusions than circuits generated using previous generators.

References

  1. Ahmed, E. and Rose, J. 2004. The effect of LUT and cluster size on deep-submicron FPGA performance and density. IEEE Trans. Very Large Scale Integr. VLSI Syst. 12, 3, 288--298. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Altera. 2008. Avalon Interface Specifications. Manual MNL-AVABUSREF-2.0.Google ScholarGoogle Scholar
  3. ARM. 2001. Amba Specification. Manual ARM IHI 0011A.Google ScholarGoogle Scholar
  4. Betz, V. 1997. VPR: A new packing, placement and routing tool for FPGA research. In Proceedings of the International Conference on Field-Programmable Logic and Applications. 213--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Betz, V., Rose, J., and Marquardt, A. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chin, S. Y. L. and Wilton, S. J. E. 2007. Memory footprint reduction for FPGA routing algorithms. In Proceedings of the International Conference on Field-Programmable Technology (ICFPT). 1--8.Google ScholarGoogle Scholar
  7. Christie, P. and Stroobandt, D. 2000. On the interpretation and application of Rent’s rule. IEEE Trans. Very Large Scale Integr. VLSI Syst. 8, 6, 639--648. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Das, J., Wilton, S. J., Leong, P., and Luk, W. 2009. Modeling post-techmapping and post-clustering FPGA circuit depth. In Proceedings of the IEEE International Conference on Field Programmable Logic and Applications (FPL). 205--211.Google ScholarGoogle Scholar
  9. eASIC. 2008. ePrize1. http://code.google.com/p/eprize1/.Google ScholarGoogle Scholar
  10. Fang, W. M. and Rose, J. 2008. Modeling routing demand for early-stage FPGA architecture development. In Proceedings of the International Symposium on Field Programmable Gate Arrays. 139--148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Ghosh, D., Kapur, N., Harlow, J., and Brglez, F. 1998. Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking. In Proceedings of the Conference on Design Automation and Test in Europe. 656--663. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Gladston, S., Hoffman, B., and Gregoire, N. 2001. SXP (Simple eXtensible Pipeline) Processor. http://opencores.org/project.exp.Google ScholarGoogle Scholar
  13. Grant, D. and Lemieux, G. 2009. Perturb+mutate: Semi-synthetic circuit generation for incremental placement and routing. ACM Trans. Reconfig. Technol. Syst. 1, 3, 1--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Harlow, J. and Brglez, F. 1997. Synthesis of ESI equivalence class combinational circuit mutants. Tech. rep. [email protected], North Carolina State University. http://www.cbl.ncsu.edu/publications.Google ScholarGoogle Scholar
  15. Hutton, M., Rose, J., Grossman, J., and Corneil, D. 1998. Characterization and parameterized generation of synthetic combinational circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17, 10, 985--996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Hutton, M., Rose, J., and Corneil, D. 2002. Automatic generation of synthetic sequential benchmark circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21, 8, 928--940. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Karypis, G. and Kumar, V. 1999. Multilevel k-way hypergraph partitioning. Tech. rep. 98-036, University of Minnesota.Google ScholarGoogle Scholar
  18. Kundarewich, P. and Rose, J. 2004. Synthetic circuit generation using clustering and iteration. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23, 6, 869--887. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Kuon, I. and Rose, J. 2008. Area and delay trade-offs in the circuit and architecture design of FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays. 149--158. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Lupas, O. 2004. Serial UART. http://opencores.org/project.uart.Google ScholarGoogle Scholar
  21. Marinissen, E. J., Iyengar, V., and Chakrabarty, K. 2007. ITC’02 SOC test benchmarks. http://www.hitech-projects.com/itc02socbenchm/.Google ScholarGoogle Scholar
  22. Mark, C. 2008. A system-level synthetic circuit generator for FPGA architectural analysis. Ph.D. dissertation, University of British Columbia.Google ScholarGoogle Scholar
  23. Mark, C., Shui, A., and Wilton, S. J. E. 2008. A system-level stochastic circuit generator for FPGA architecture evaluation. In Proceedings of the International Conference on Field-Programmable Technology (ICFPT’08). 25--32.Google ScholarGoogle Scholar
  24. Pistorius, J., Legai, E., and Minoux, M. 2000. Partgen: A generator of very large circuits to benchmark the partitioning of FPGAs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19, 11, 1314--1321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Stroobandt, D., Verplaetse, P., and Campenhout, J. V. 2000. Generating synthetic benchmark circuits for evaluating CAD tools. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19, 9, 1011--1022. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Trimberger, S. 2007. Keynote talk: Redefining the FPGA. In Proceedings of the International Conference on Field-Programmable Logic and Applications.Google ScholarGoogle Scholar
  27. Verplaetse, P., Campenhout, J. V., and Stroobandt, D. 2000. On synthetic benchmark generation methods. In Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS). 213--216.Google ScholarGoogle Scholar
  28. Wilton, S. 1997. Architecture and algorithms for field-programmable gate arrays with embedded memory. Ph.D. dissertation, University of Toronto. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Xilinx. 2006. Virtex-5 family review. Data Sheet DS100.Google ScholarGoogle Scholar
  30. Yang, S. 1991. Logic Synthesis and Optimization Benchmarks User Guide, Versions 3.0. http://books.google.ca/books?id=7ruGuAAACAAJ.Google ScholarGoogle Scholar
  31. Zarkesh-Ha, P., Davis, J. A., Loh, W., and Meindl, J. D. 1998. On a pin versus gate relationship for heterogeneous systems: Heterogeneous Rent’s rule. In Proceedings of the Custom Integrated Circuits Conference (CICC). 93--96.Google ScholarGoogle Scholar

Index Terms

  1. Hierarchical Benchmark Circuit Generation for FPGA Architecture Evaluation

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!