Parametric throughput analysis of scenario-aware dataflow graphs

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

19 Citations (Scopus)
109 Downloads (Pure)

Abstract

Scenario-aware dataflow graphs (SADFs) efficiently model dynamic applications. The throughput of an application is an important metric to determine the performance of the system. For example, the number of frames per second output by a video decoder should always stay above a threshold that determines the quality of the system. During design-space exploration (DSE) or run-time management (RTM), numerous throughput calculations have to be performed. Throughput calculations have to be performed as fast as possible. For synchronous dataflow graphs (SDFs), a technique exists that extracts throughput expressions from a parameterized SDF in which the execution time of the tasks (actors) is a function of some parameters. Evaluation of these expressions can be done in a negligible amount of time and provides the throughput for a specific set of parameter values. This technique is not applicable to SADFs. In this paper, we present a technique, based on Max-Plus automata, that finds throughput expressions for a parameterized SADF. Experimental evaluation shows that our technique can be applied to realistic applications. These results also show that our technique is better scalable and faster compared to the available parametric throughput analysis technique for SDFs.
Original languageEnglish
Title of host publicationProceedings of the 30th International Conference on Computer Design(ICCD), 30- September-3 October 2012, Montreol, Quebec, Canada
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
Pages219-226
ISBN (Print)978-1-4673-3051-0
DOIs
Publication statusPublished - 2012
Event30th IEEE International Conference on Computer Design (ICCD 2012) - Montreal, Canada
Duration: 30 Sep 20123 Oct 2012
Conference number: 30
http://www.iccd-conf.com/2012/

Conference

Conference30th IEEE International Conference on Computer Design (ICCD 2012)
Abbreviated titleICCD 2012
CountryCanada
CityMontreal
Period30/09/123/10/12
Internet address

Fingerprint Dive into the research topics of 'Parametric throughput analysis of scenario-aware dataflow graphs'. Together they form a unique fingerprint.

Cite this