@article{Letras:2024,
abstract = {This paper presents an approach for reducing the memory requirements of periodically executed dataflow applications, while minimizing the period when deployed on a many-core target. Often, implementations of dataflow applications suffer from data duplication if identical data has to be processed by multiple actors. In fact, multi-cast (also called fork) actors can produce huge memory overheads when storing and communicating copies of the same data. As a remedy, so-called Multi-Reader Buffers ({MRBs}) can be utilized to forward identical data to multiple actors in a First In First Out ({FIFO}) manner while storing each data item only once by sharing. However, using {MRBs} may increase the achievable period due to contention when accessing the shared data. This paper proposes a novel multi-objective design space exploration approach that selectively replaces multi-cast actors with {MRBs} and explores actor and {FIFO} channel mappings to find trade-offs between the objectives of period, memory footprint, and core cost. In distinction to the state-of-the-art, our approach considers (i) memory-size constraints for on-chip memories, (ii) hierarchical memories to implement the buffers, e.g., tile-local memories, (iii) supports heterogeneous many-core platforms, i.e., core-type dependent actor execution times, and (iv) optimizes the buffer placement and overall scheduling to minimize the execution period by proposing a novel combined actor and communication scheduling heuristic for period minimization called Communication-Aware Periodic Scheduling on Heterogeneous Many-core Systems ({CAPS}-{HMS}). Our results show that the explored Pareto fronts improve a hypervolume indicator over a reference approach by up to 66 \% for small to mid-size applications and 90 \% for large applications. Moreover, selectively replacing multi-cast actors with corresponding {MRBs} proves to be always superior to never or always replacing them. Finally, it is shown that the quality of the explored Pareto fronts does not degrade when replacing the efficient scheduling heuristic {CAPS}-{HMS} by an Integer Linear Program ({ILP}) solver that requires orders of magnitude higher solver times and thus cannot be applied to large scale dataflow network problems.},
author = {Letras, Martin and Falk, Joachim and Teich, Jürgen},
date = {2024-03-07},
doi = {10.1109/ACCESS.2024.3375079},
issn = {2169-3536},
journaltitle = {{IEEE} Access},
keywords = {Minimization, Firing, Schedules, Processor scheduling, Throughput, Image processing, Space exploration, Many-core systems, dataflow networks, mapping, Pareto optimization, memory management, modulo scheduling},
pages = {39748–39769},
title = {Exploring Multi-Reader Buffers and Channel Placement During Dataflow Network Mapping to Heterogeneous Many-Core Systems},
url = {https://ieeexplore.ieee.org/document/10463021},
volume = {12},
}
