HomeHome

From Functional Programs to Pipelined Dataflow Circuits

Richard Morse Townsend; Martha Allen Kim; Stephen A. Edwards

Title:
From Functional Programs to Pipelined Dataflow Circuits
Author(s):
Townsend, Richard Morse
Kim, Martha Allen
Edwards, Stephen A.
Date:
Type:
Articles
Department(s):
Computer Science
Persistent URL:
Book/Journal Title:
Proceedings of the 26th International Conference on Compiler Construction
Book Author:
Wu, Peng
Publisher:
Association for Computing Machinery
Abstract:
We present a translation from programs expressed in a functional IR into dataflow networks as an intermediate step within a Haskell-to-Hardware compiler. Our networks exploit pipeline parallelism, particularly across multiple tail-recursive calls, via non-strict function evaluation. To handle the long-latency memory operations common to our target applications, we employ a latency-insensitive methodology that ensures arbitrary delays do not change the functionality of the circuit. We present empirical results comparing our networks against their strict counterparts, showing that nonstrictness can mitigate small increases in memory latency and improve overall performance by up to 2x.
Subject(s):
Compilers (Computer programs)
Logic design
Data flow computing
Publisher DOI:
https://doi.org/10.1145/3033019.3033027
Item views
51
Metadata:
text | xml
Suggested Citation:
Richard Morse Townsend, Martha Allen Kim, Stephen A. Edwards, , From Functional Programs to Pipelined Dataflow Circuits, Columbia University Academic Commons, .

Columbia University Libraries | Policies | FAQ