Automatic dataflow model extraction from modal real-time stream processing applications

Geuns, Stefan J.; Hausmans, Joost P.H.M.; Bekooij, Marco

doi:10.1145/2491899.2465561

Cited by 7 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, no corresponding temporal analysis model is defined. A temporal analysis model for analyzing applications containing while-loops is introduced in [12]. In their approach, a sequential specification is parallelized, which enables the derivation of a corresponding analysis model.…”

Section: Related Workmentioning

confidence: 99%

“…The real-time constraints that are imposed by the environment on the application are described by sources and sinks [12]. Sources and sinks allow for communication between an application and its environment.…”

Section: Sources and Sinksmentioning

confidence: 99%

“…Efficient analysis of the minimum throughput of an application is based on the method presented in [12]. Conditions are presented under which an SVPDF model can be analyzed using a flattened SVPDF model, i.e.…”

Section: Minimum Throughput Analysismentioning

confidence: 99%

“…Dataflow models, such as Synchronous Dataflow (SDF) models [14], can describe the synchronization behavior and can be used for deadlock analysis as well as temporal analysis. One application of these models is to verify whether an application meets its throughput constraints [12]. Also mapping an application to an MPSoC [16] and determining suitable scheduler settings can be done using dataflow models [19].…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, it provides the programmer with a familiar and simple programming model. Simultaneously with parallelizing an application, a corresponding temporal analysis model can be derived [12]. However, this method is limited to the specification of single-rate applications.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Temporal analysis model extraction for optimizing modal multi-rate stream processing applications

Geuns

Hausmans

Bekooij

2014

Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems

Self Cite

View full text Add to dashboard Cite

Modern real-time stream processing applications, such as Software Defined Radio (SDR) applications, typically have multiple modes and multi-rate behavior. Modes are often described using whileloops whereas multi-rate behavior is frequently described using arrays with pseudo-random indexing patterns. The temporal properties of these applications have to be analyzed in order to determine whether optimizations improve throughput. However, no method exists in which a temporal analysis model is derived from these applications that is suitable for temporal analysis and optimization.In this paper an approach is presented in which a concurrency model for the temporal analysis and optimization of stream processing applications is automatically extracted from a parallelized sequential application. With this model it can be determined whether a program transformation improves the worst-case temporal behavior. The key feature of the presented approach is that arrays with arbitrary indexing patterns can be described, allowing the description of multi-rate behavior, while still supporting the description of modes using while-loops. In the model, an overapproximation of the synchronization dependencies is used in case of arrays with pseudo-random indexing patterns. Despite the use of this approximation, we show that deadlock is only concluded from the model if there is also deadlock in the parallelized application. The relevance and applicability of the presented approach are demonstrated using an Orthogonal Frequency-Division Multiplexing (OFDM) transmitter application.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Sources and Sinksmentioning

confidence: 99%

Section: Minimum Throughput Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Temporal analysis model extraction for optimizing modal multi-rate stream processing applications

Geuns

Hausmans

Bekooij

2014

Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems

Self Cite

View full text Add to dashboard Cite

show abstract

Performance Analysis of Weakly-Consistent Scenario-Aware Dataflow Graphs

Geilen

Falk

Haubelt

et al. 2016

J Sign Process Syst

View full text Add to dashboard Cite

The timed dataflow model of computation is a useful performance analysis tool for electronic system level design automation and embedded software synthesis. Its determinism gives it strong analyzability properties. Its monotonic temporal behavior provides hard real-time guarantees on throughput and latency. It is expressive enough to cover a large class of applications and platforms. The trend however, in both embedded applications and their platforms is to become more dynamic, reaching the limits of what the model can express and analyze with tight performance guarantees. Scenario-aware dataflow (SADF) allows more dynamism to be expressed, introducing a controlled amount of non-determinism into the model to represent different scenarios of behavior. We investigate so-called weakly consistent graphs in which the scenario changes are not tightly coupled with periods of repetitive behavior of the static dataflow behavior in scenarios as in previous methods. We define the semantics of such graphs in terms of (max, +)algebra and we introduce a method to analyze throughput using a generalization of (max, +)-automata. We show that Marc Geilen M.

show abstract

Accuracy Improvement of Dataflow Analysis for Cyclic Stream Processing Applications Scheduled by Static Priority Preemptive Schedulers

Wilmanns

Hausmans

Geuns

et al. 2014

2014 17th Euromicro Conference on Digital System Design

Self Cite

View full text Add to dashboard Cite

Stream processing applications executed on embedded multiprocessor systems regularly contain cyclic data dependencies due to the presence of feedback loops and bounded FIFO buffers. Dataflow modeling is suitable for the temporal analysis of such applications. However, the accuracy can be unsatisfactory as existing temporal analysis techniques ignore that cyclic data dependencies limit interference between tasks executed on shared processors.This paper presents a dataflow analysis approach that increases the analysis accuracy by taking into account that cyclic data dependencies limit interference between tasks. It is shown that the approach is applicable for single-rate stream processing applications that are executed on multiprocessor systems using static priority preemptive schedulers.The improvement of accuracy is demonstrated in a case study employing a WLAN 802.11p transceiver application that is executed on a multiprocessor system with shared processors.

show abstract

Automatic dataflow model extraction from modal real-time stream processing applications

Cited by 7 publications

References 15 publications

Temporal analysis model extraction for optimizing modal multi-rate stream processing applications

Temporal analysis model extraction for optimizing modal multi-rate stream processing applications

Performance Analysis of Weakly-Consistent Scenario-Aware Dataflow Graphs

Accuracy Improvement of Dataflow Analysis for Cyclic Stream Processing Applications Scheduled by Static Priority Preemptive Schedulers

Contact Info

Product

Resources

About