• DocumentCode
    624324
  • Title

    Loop program mapping and compact code generation for programmable hardware accelerators

  • Author

    Boppu, Srinivas ; Hannig, Frank ; Teich, Jurgen

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Erlangen-Nuremberg, Erlangen, Germany
  • fYear
    2013
  • fDate
    5-7 June 2013
  • Firstpage
    10
  • Lastpage
    17
  • Abstract
    We present a novel design methodology for the mapping of nested loops onto programmable hardware accelerators. Key features of our approach are: (1) Design entry in form of a functional programming language and loop parallelization in the polyhedron model, (2) the underlying accelerator architectures consist of lightweight, tightly-coupled, and programmable processor arrays, which can exploit both loop-level parallelism and instruction-level parallelism, (3) support of zero-overhead looping not only for inner most loops but also for arbitrarily nested loops. We implemented the proposed methodology in a prototype design tool and evaluated selected benchmarks by comparing our code generator with the Trimaran compilation framework. As the results show, our approach can reduce the size of the generated processor codes up to 64 % while at the same time achieving a significant higher throughput.
  • Keywords
    multiprocessing systems; program compilers; programming languages; system-on-chip; MPSoC; Trimaran compilation framework; compact code generation; functional programming language; generated processor codes; instruction level parallelism; loop level parallelism; loop program mapping; multiprocessor System-on-Chip; nested loops; polyhedron model; programmable hardware accelerators; underlying accelerator architectures; zero overhead looping; Accelerator architectures; Hardware; Parallel processing; Registers; Schedules; VLIW;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application-Specific Systems, Architectures and Processors (ASAP), 2013 IEEE 24th International Conference on
  • Conference_Location
    Washington, DC
  • ISSN
    2160-0511
  • Print_ISBN
    978-1-4799-0494-5
  • Type

    conf

  • DOI
    10.1109/ASAP.2013.6567544
  • Filename
    6567544