Compiling graph intermediate code for Maxeler dataflow engines
Miha Eleršič · 2015
In this thesis we describe the back end of a source-to-source compiler for compiling a Haskell-like language MaxHs to source code suitable for Maxeler dataflow engines. We focus on correct compilation of dataflow graphs that include cycles and related scheduling problems, which are a side effect of static scheduling used by MaxCompiler. We describe a way of programing that allows the programmer to write programs accelerated with Maxeler dataflow engines without detailed knowledge of the Maxeler architecture.