Buffer minimization for rate-optimal scheduling of synchronous dataflow graphs on multicore systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Streaming applications are generally modelled by dataflow graphs, among which Synchronous Dataflow Graphs (SDFGs) are one of the most popular models. Self-timed Execution (STE) based methods are proved to be very powerful for analyzing and scheduling SDFGs. In this paper, an extension of STE is presented based on which, an exact algorithm is proposed to find the minimal memory usage for buffering to guarantee execution under maximal throughput (rate-optimal execution) of an SDFG on a multicore system. Experimental results show that the proposed exact algorithm obtains less buffer usage than a widely used state-of-art heuristic in a number of cases and equal buffer usage in the rest. In addition, a heuristic is proposed as an efficient approximate method, which gives equal or less buffer usage than a state-of-art heuristic.

Original languageEnglish
Title of host publicationAlgorithms and Architectures for Parallel Processing - 16th International Conference, ICA3PP 2016, Proceedings
EditorsJesus Carretero, Koji Nakano, Ryan K.L. Ko, Peter Mueller, Javier Garcia-Blas
PublisherSpringer Nature
Pages325-340
Number of pages16
ISBN (Print)9783319495828
DOIs
Publication statusPublished - 1 Jan 2016
Event16th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2016 - Granada, Spain
Duration: 14 Dec 201616 Dec 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10048 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2016
Country/TerritorySpain
CityGranada
Period14/12/1616/12/16

Fingerprint

Dive into the research topics of 'Buffer minimization for rate-optimal scheduling of synchronous dataflow graphs on multicore systems'. Together they form a unique fingerprint.

Cite this