Treffer: OmpSs@FPGA Framework for High Performance FPGA Computing.

Title:
OmpSs@FPGA Framework for High Performance FPGA Computing.
Authors:
de Haro, Juan Miguel1 (AUTHOR) juan.deharoruiz@bsc.es, Bosch, Jaume1 (AUTHOR) jaume.bosch@bsc.es, Filgueras, Antonio1 (AUTHOR) antonio.filgueras@bsc.es, Vidal, Miquel1 (AUTHOR) miquel.vidal@bsc.es, Jimenez-Gonzalez, Daniel1 (AUTHOR) djimenez@ac.upc.edu, Alvarez, Carlos1 (AUTHOR) calvarez@ac.upc.edu, Martorell, Xavier1 (AUTHOR) xavim@ac.upc.edu, Ayguade, Eduard1 (AUTHOR) eduard.ayguade@bsc.es, Labarta, Jesus1 (AUTHOR) jesus.labarta@bsc.es
Source:
IEEE Transactions on Computers. Dec2021, Vol. 70 Issue 12, p2029-2042. 14p.
Database:
Business Source Premier

Weitere Informationen

This article presents the new features of the OmpSs@FPGA framework. OmpSs is a data-flow programming model that supports task nesting and dependencies to target asynchronous parallelism and heterogeneity. OmpSs@FPGA is the extension of the programming model addressed specifically to FPGAs. OmpSs environment is built on top of Mercurium source to source compiler and Nanos++ runtime system. To address FPGA specifics Mercurium compiler implements several FPGA related features as local variable caching, wide memory accesses or accelerator replication. In addition, part of the Nanos++ runtime has been ported to hardware. Driven by the compiler this new hardware runtime adds new features to FPGA codes, such as task creation and dependence management, providing both performance increases and ease of programming. To demonstrate these new capabilities, different high performance benchmarks have been evaluated over different FPGA platforms using the OmpSs programming model. The results demonstrate that programs that use the OmpSs programming model achieve very competitive performance with low to moderate porting effort compared to other FPGA implementations. [ABSTRACT FROM AUTHOR]

Copyright of IEEE Transactions on Computers is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)