Skip to main navigation Skip to search Skip to main content

A programming model for reconfigurable computing based in functional concurrency

  • William L. Harrison
  • , Ian Graves
  • , Adam Procter
  • , Michela Becchi
  • , Gerard Allwein

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Abstract

FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. The starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms; we illustrate this with several case studies.
Original languageAmerican English
Title of host publication2016 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)
PublisherIEEE
Pages1-8
Number of pages8
ISBN (Print)978-1-5090-2521-3
DOIs
StatePublished - Jun 29 2016
Externally publishedYes
Event2016 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) - Tallinn, Estonia
Duration: Jun 27 2016 → Jun 29 2016

Conference

Conference2016 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)
Period06/27/16 → 06/29/16

Keywords

  • Hardware
  • Concurrent computing
  • Clocks
  • Parallel processing
  • Programming
  • Software engineering
  • Computational modeling

Fingerprint

Dive into the research topics of 'A programming model for reconfigurable computing based in functional concurrency'. Together they form a unique fingerprint.

Cite this