Paper Info
Title
Throughput-Bufering Trade-Of Analysis For Scenario-Aware Dataflow Models
Abstract
In multi-media applications, bufers represent storage spaces that are used to store the data communicated between different tasks in the application, and throughput refers to the rate at which output data is produced by the application. The capacities of the bufers influence the throughput, by altering the waiting times for tasks that need to read or write data from or to the bufers. The bufers are realized using memory. To minimize the memory usage, we look for algorithms to compute the minimal capacity requirements for bufers to execute an application under a given throughput constraint. Synchronous dataflow (SDF) is a common formalism used to model applications in such algorithms. SDF however, is not suitable to describe today's dynamic applications, as it cannot express task variations. Finite-State-Machine Scenario-Aware Dataflow (FSM-SADF) is an extension of SDF that allows for not only task variations, but also structural variations, making it suitable for a wide range of dynamic applications. This paper provides the first throughput-buffering trade-of analysis for FSM-SADF models. The analysis provides the Pareto space of throughput and storage space tradeoffs. The trade-of analysis is done by a guided Design Space Exploration (DSE) that cuts-of the exploration on non-critical bufers. The core of such a DSE is an FSM-SADF throughput analysis that, given the capacity of every buffer, obtains the throughput, as well as the critical bufers. We demonstrate the feasibility of our analysis with a number of examples.
Year
DOI
Venue
2018
10.1145/3273905.3273921
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2018)
Field
DocType
Citations 
Computer science,Data-flow analysis,Static timing analysis,Dataflow,Digital storage,Throughput,Design space exploration,Pareto principle,Dataflow model,Distributed computing
Conference
0
PageRank 
References 
Authors
0.34
12
4
Name
Order
Citations
PageRank
Hadi Alizadeh Ara133.50
Marc Geilen2134684.30
Amir R. B. Behrouzian322.48
Twan Basten41833132.45