Refereed article in conference proceedings (A4)

Compiler assisted dynamic allocation of finite hardware acceleration resources for parallel tasks




List of Authors: Jari-Matti Mäkelä, Martti Forsell, Ville Leppänen

Conference name: International Conference on Computer Systems and Technologies

Place: New York

Publication year: 2016

Book title *: Proceeding CompSysTech '16: Proceedings of the 17th International Conference on Computer Systems and Technologies 2016

Title of series: ICPS: ACM International Conference Proceeding Series

Volume number: 1164

Number of pages: 8

ISBN: 978-1-4503-4182-0

DOI: http://dx.doi.org/10.1145/2983468.2983494

URL: http://dl.acm.org/citation.cfm?id=2983494


Abstract



With the modern chip design
facing the so called frequency, power and other walls, multi-core
systems have become dominant. Due to the relatively large operating cost
of fine-grained parallelism, the systems are often task-oriented.

With
the recent appearance of more synchronous platforms for parallel
computing, we propose a language supported task system optimization for
strictly synchronous multi-core architectures equipped with hardware
accelerated multi-prefix operations and other finite resources (with
respect to concurrent access). The purpose of this system is to
dynamically manage the error prone allocation of such resources, yet
provide reasonable performance speedups without placing the burden of
resource management to the programmer. Our system compiles several
specialized versions of accelerated functions that are dynamically
picked by the runtime task system based on the tasks' requirements and
the resource availability.






Last updated on 2021-24-06 at 10:10