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




Jari-Matti Mäkelä, Martti Forsell, Ville Leppänen

Boris Rachev, Angel Smrikarov

International Conference on Computer Systems and Technologies

New York

2016

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

ICPS: ACM International Conference Proceeding Series

1164

49

56

8

978-1-4503-4182-0

DOIhttps://doi.org/10.1145/2983468.2983494

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






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 2024-26-11 at 17:23