Numerical Representation of Directed Acyclic Graphs for Efficient Dataflow Embedded Resource Allocation

Abstract : Stream processing applications running on Heterogeneous Multi-Processor Systems on Chips (HMPSoCs) require efficient resource allocation and management, both at compile-time and at runtime. To cope with modern adaptive applications whose behavior can not be exhaustively predicted at compile-time, runtime managers must be able to take resource allocation decisions on-the-fly, with a minimum overhead on application performance. Resource allocation algorithms often rely on an internal modeling of an application. Directed Acyclic Graph (DAGs) are the most commonly used models for capturing control and data dependencies between tasks. DAGs are notably often used as an intermediate representation for deploying applications modeled with a dataflow Model of Computation (MoC) on HMPSoCs. Building such intermediate representation at runtime for massively parallel applications is costly both in terms of computation and memory overhead. In this paper, an intermediate representation of DAGs for resource allocation is presented. This new representation shows improved performance for run-time analysis of dataflow graphs with less overhead in both computation time and memory footprint. The performances of the proposed representation are evaluated on a set of computer vision and machine learning applications.
Document type :
Journal articles
Complete list of metadatas

https://hal-univ-rennes1.archives-ouvertes.fr/hal-02355636
Contributor : Laurent Jonchère <>
Submitted on : Friday, November 8, 2019 - 1:12:51 PM
Last modification on : Tuesday, November 19, 2019 - 11:35:08 AM

Identifiers

Citation

Florian Arrestier, Karol Desnos, Eduardo Juarez, Daniel Menard. Numerical Representation of Directed Acyclic Graphs for Efficient Dataflow Embedded Resource Allocation. ACM Transactions on Embedded Computing Systems (TECS), ACM, 2019, 18 (5), ⟨10.1145/3358225⟩. ⟨hal-02355636⟩

Share

Metrics

Record views

14