skip to main content
research-article

JITPR: A framework for supporting fast application's implementation onto FPGAs

Published:02 August 2013Publication History
Skip Abstract Section

Abstract

The execution runtime usually is a headache for designers performing application mapping onto reconfigurable architectures. In this article we propose a methodology, as well as the supporting toolset, targeting to provide fast application implementation onto reconfigurable architectures with the usage of a Just-In-Time (JIT) compilation framework. Experimental results prove the efficiency of the introduced framework, as we reduce the execution runtime compared to the state-of-the-art approach on average by 53.5×. Additionally, the derived solutions achieve higher operation frequencies by 1.17×, while they also exhibit significant lower fragmentation ratios of hardware resources.

References

  1. Betz, V., Rose, J., and Marquardt, A., Eds. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers, Norwell, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Flynn, A., Gordon-Ross, A., and George, A. 2009. Bitstream relocation with local clock domains for partially reconfigurable fpgas. In Proceedings of the Conference Exhibition on Design, Automation Test in Europe (DATE'09). 300--303. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Gort, M. and Anderson, J. 2011. Reducing fpga router run-time through algorithm and architecture. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL'11). 336--342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Hubner, M., Figuli, P., Girardey, R., Soudris, D., Siozios, K., and Becker, J. 2011. A heterogeneous multicore system on chip with run-time reconfigurable virtual fpga architecture. In Proceedings of the IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum (IPDPSW'11). IEEE Computer Society, 143--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Mcmurchie, L. and Ebeling, C. 1995. Pathfinder: A negotiation-based performance-driven router for fpgas. In Proceedings of the 3rd ACM International Symposium on Field-Programmable Gate Arrays. (FPGA'95). ACM Press, New York, 111--117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sidiropoulos, H., Siozios, K., and Soudris, D. 2012a. On supporting rapid exploration of memory hierarchies onto fpgas. J. Syst. Archit. Embed. Syst. Des. 59, 2, 78--90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Sidiropoulos, H., Siozios, K., Figuli, P., Soudris, D., and Hubner, M. 2012b. On supporting efficient partial reconfiguration with just-in-time compilation. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops and PhD Forum (IPDPSW'12). 328--335. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Silva, M. and Ferreira, J. 2008. Generation of partial fpga configurations at run-time. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL'08). 367--372.Google ScholarGoogle Scholar
  9. Siozios, K., Soudris, D., and Thanailakis, A. 2010. A novel allocation methodology for partial and dynamic bitstream generation of fpga architectures. J. Circ. Syst. Comput. 19, 3, 701--717.Google ScholarGoogle ScholarCross RefCross Ref
  10. Tessier, R. 2002. Fast placement approaches for fpgas. ACM Trans. Des. Autom. Electron. Syst. 7, 2, 284--305. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Wu, Q. and Mcelvain, K. S. 2012. A fast discrete placement algorithm for fpgas. In Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA'12). ACM Press, New York, 115--118. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Yang, S. 1991. Logic synthesis and optimization benchmarks user guide version 3.0. Tech. rep., Microcenter of North Carolina.Google ScholarGoogle Scholar

Index Terms

  1. JITPR: A framework for supporting fast application's implementation onto FPGAs

    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

    • Published in

      cover image ACM Transactions on Reconfigurable Technology and Systems
      ACM Transactions on Reconfigurable Technology and Systems  Volume 6, Issue 2
      Special Section on 19th Reconfigurable Architectures Workshop (RAW 2012)
      July 2013
      90 pages
      ISSN:1936-7406
      EISSN:1936-7414
      DOI:10.1145/2499625
      Issue’s Table of Contents

      Copyright © 2013 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 August 2013
      • Accepted: 1 April 2013
      • Revised: 1 January 2013
      • Received: 1 September 2012
      Published in trets Volume 6, Issue 2

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    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!