Show simple item record

dc.contributor.authorKing, Myron
dc.contributor.authorKhan, Asif
dc.contributor.authorAgarwal, Abhinav
dc.contributor.authorArvind, Arvind
dc.date.accessioned2019-06-28T13:50:49Z
dc.date.available2019-06-28T13:50:49Z
dc.date.issued2013-09
dc.identifier.isbn978-1-4799-0004-6
dc.identifier.urihttps://hdl.handle.net/1721.1/121447
dc.description.abstractWhether for use as the final target or simply a rapid prototyping platform, programming systems containing FPGAs is challenging. Some of the difficulty is due to the difference between the models used to program hardware and software, but great effort is also required to coordinate the simultaneous execution of the application running on the microprocessor with the accelerated kernel(s) running on the FPGA. In this paper we present a new methodology and programming model for introducing hardware-acceleration to an application running in software. The application is represented as a data-flow graph and the computation at each node in the graph is specified for execution either in software or on the FPGA using the programmer's language of choice. We have implemented an interface compiler which takes as its input the FIFO edges of the graph and generates code to connect all the different parts of the program, including those which communicate across the hardware/software boundary. Our methodology and compiler enable programmers to effectively exploit FPGA acceleration without ever leaving the application space.en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionof10.1109/FPL.2013.6645495en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleGenerating infrastructure for FPGA-accelerated applicationsen_US
dc.typeArticleen_US
dc.identifier.citationKing, Myron, Asif Khan, Abhinav Agarwal, Oriol Arcas and Arvind. "Generating infrastructure for FPGA-accelerated applications." Paper presented at the 2013 23rd International Conference on Field programmable Logic and Applications, Porto, Portugal, 2-4 September 2013.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.relation.journal2013 23rd International Conference on Field programmable Logic and Applicationsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-06-27T16:58:10Z
dspace.date.submission2019-06-27T16:58:11Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record