ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Compiling graph intermediate code for Maxeler dataflow engines

Miha Eleršič (2015) Compiling graph intermediate code for Maxeler dataflow engines. EngD thesis.

[img]
Preview
PDF
Download (1515Kb)

    Abstract

    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.

    Item Type: Thesis (EngD thesis)
    Keywords: dataflow programming, Haskell, Maxeler, compiler
    Number of Pages: 54
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Boštjan Slivnik280Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536495811)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3073
    Date Deposited: 12 Sep 2015 12:38
    Last Modified: 22 Sep 2015 13:53
    URI: http://eprints.fri.uni-lj.si/id/eprint/3073

    Actions (login required)

    View Item